[leetcode] 33. Search in Rotated Sorted Array
来源:互联网 发布:php mysql 查询 实例 编辑:程序博客网 时间:2024/06/06 13:17
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
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
解法一:
二分法,先确定那边是ordered数组。
class Solution {public: int search(vector<int>& nums, int target) { if(nums.empty()) return 0; int left = 0, right = nums.size()-1; while(left<=right){ int mid = (left+right)/2; if(target== nums[mid]) return mid; else if(nums[mid]<nums[right]){ if(target>nums[mid] && target<=nums[right]) left = mid +1; else right = mid -1; } else{ if(target>=nums[left] && target < nums[mid]) right = mid -1; else left = mid + 1; } } return -1; }};
0 0
- [LeetCode]33.Search in Rotated Sorted Array
- LeetCode --- 33. Search in Rotated Sorted Array
- LeetCode 33.Search in Rotated Sorted Array
- [Leetcode] 33. Search in Rotated Sorted Array
- Leetcode-33.Search in Rotated Sorted Array.
- [leetcode] 33. Search in Rotated Sorted Array
- Leetcode 33. Search in Rotated Sorted Array
- [LeetCode]33. Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array
- LeetCode *** 33. Search in Rotated Sorted Array
- LeetCode - 33. Search in Rotated Sorted Array
- LeetCode 33. Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array
- leetcode 33.Search in Rotated Sorted Array
- [leetcode]33. Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array
- LeetCode-33.Search in Rotated Sorted Array
- Android APK反编译就这么简单 详解(附图)
- 从金山毒霸看这个社会的“底线”
- 基于NX的研发产品设计管理平台实现(十四)-数据查询1
- RTL8762 开发板试用
- MFC的UDP编程实现(转)
- [leetcode] 33. Search in Rotated Sorted Array
- 欢迎使用CSDN-markdown编辑器
- 再次实践并成功在win7下安装ubuntu16.04
- 像超哥一样。
- 输入一个字符,判断它是否是大写字母。
- UDP编程
- JavaScript比较大数字符串
- 人性最黑暗的部分——北漂18年(67)
- WEB音频API