C++ || Binary Search || 0 ms || Beats 100%
\n# Code\n\nclass Solution {\npublic:\n    int findMin(vector<int>& nums) {\n        int low = 0;\n        int high = nums.size() - 1;\n        int ans = INT_MA
\n# Code\n```\nclass Solution {\npublic:\n    int findMin(vector<int>& nums) {\n        int low = 0;\n        int high = nums.size() - 1;\n        int ans = INT_MAX;\n        while(low <= high) {\n            int mid = (low + high) / 2;\n            if(nums[low] <= nums[mid]) {\n                ans = min(ans, nums[low]);\n                low = mid + 1;\n            } else {\n                ans = min(ans, nums[mid]);\n                high = mid - 1;\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']