Leetcode 33. Search in Rotated Sorted Array
来源：互联网 发布：淘宝卖家破损补寄 编辑：程序博客网 时间：2024/06/06 01:10
Three cases:
0 1 2 3 4 5 6 7
2 3 4 5 6 7 0 1
6 7 0 1 2 3 4 5
int search(int A[], int target) {int left = 0, right = A.length - 1;while (left <= right) {int mid = (left + right) / 2;if (A[mid] == target) {return mid;}if (A[mid] >= A[left]) {if (A[left] <= target && target < A[mid]) {right = mid - 1;} else {left = mid + 1;}} else {if (A[mid] < target && target <= A[right]) {left = mid + 1;} else {right = mid - 1;}}}return -1;}refer: http://fisherlei.blogspot.com/2013/01/leetcode-search-in-rotated-sorted-array.html
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
- Top K Frequent Elements
- 为AndroidStudio设置自定义类注释
- 杭电oj编码2007
- var的用法
- 常见拒绝服务型攻击原理及行为特征
- Leetcode 33. Search in Rotated Sorted Array
- Css与html三种结合方式 Css四种选择器
- Vagrant安装
- 杭电oj编码2006
- 杭电oj编码2005
- 数据结构——栈应用（表达式计算）
- 191. Number of 1 Bits
- 杭电oj编码2004
- CodeForces 560D Equivalent Strings【递归+贪心】
