leetcode #153 in cpp
来源：互联网 发布：vc http post json 编辑：程序博客网 时间：2024/05/01 22:51
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
Find the minimum element.
You may assume no duplicate exists in the array.
Code:
class Solution {public: int findMin(vector<int>& nums) { int h = nums.size() - 1; int l = 0; int minn = INT_MAX; while(l<=h){ int mid = (l+h)/2; if(nums[mid] > nums[h]){//if the pivot is contained in nums[mid ...h], we can abandon nums[l...mid] minn = min(nums[l], minn); l = mid + 1; }else{//if the pivot is contained in nums[l ...mid], we can abandon nums[mid...h] minn = min(nums[mid],minn); h = mid - 1; } } return minn; }}; 0 0
- leetcode #153 in cpp
- leetcode #153 in cpp
- leetcode #12 in cpp
- Leetcode #13 in cpp
- Leetcode #14 in cpp
- leetcode %15 in cpp
- leetcode #16 in cpp
- leetcode #17 in cpp
- leetcode #18 in cpp
- leetcode #20 in cpp
- leetcode #21 in cpp
- leetcode #22 in cpp
- leetcode #23 in cpp
- leetcode #24 in cpp
- leetcode #25 in cpp
- leetcode #26 in cpp
- leetcode #27 in cpp
- leetcode #28 in cpp
- 【js】window.addEventListener介绍说明
- 警卫安排
- dubbo 用户名密码问题
- 用exp无法导出空表解决方法,可能提示ora-01455错误
- S3C6410按键驱动
- leetcode #153 in cpp
- Linux 下 Mysql 的安装与卸载
- 被谷歌抛弃的机器人，这回狠狠打了谷歌的脸
- Linux内核驱动基础(4)驱动模型的思考
- 关于用sql语句select多个字段，该使用什么接收的解决办法
- 日志分析sql
- springMVC_04_分享
- Xcode请求不了数据看这里
- Installing Virtual Machines with virt-install
