leetcode Search in Rotated Sorted Array
来源:互联网 发布:安装包制作工具 知乎 编辑:程序博客网 时间:2024/04/20 23:38
此题同样需要二分法来解决, 但是在判断targetNum在哪一边的时候复杂了一些
首先在左右两边选取顺序没有被打乱的一边
然后判断targetNum是否在该范围内,若在,则在该范围内继续利用二分法,若不在,则在另外一边进行二分查找
代码
class Solution {public: int search(int A[], int n, int target) { if(n==0) return -1; int left = 0; int right = n-1; while(left<=right) { int mid = (left+right)/2; if(A[mid]==target) return mid; if(A[mid]<A[right]) { if(A[mid]<target&&target<=A[right]) left = mid + 1; else right = mid - 1; } else { if(target>=A[left] && target<A[mid]) right = mid - 1; else left = mid + 1; } } return -1; }};
0 0
- [leetcode][search] Search in Rotated Sorted Array
- LeetCode: Search in Rotated Sorted Array
- LeetCode: Search in Rotated Sorted Array II
- LeetCode Search in Rotated Sorted Array
- LeetCode Search in Rotated Sorted Array II
- [Leetcode] Search in Rotated Sorted Array
- LeetCode : Search in Rotated Sorted Array
- LeetCode : Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array
- [Leetcode] Search in a Rotated Sorted Array
- [Leetcode] Search in Rotated Sorted Array II
- leetcode 97: Search in Rotated Sorted Array
- [LeetCode] Search in Rotated Sorted Array
- [leetcode] Search in Rotated Sorted Array
- [leetcode] Search in Rotated Sorted Array II
- Leetcode Search in Rotated Sorted Array
- [LeetCode]Search in Rotated Sorted Array
- Android Canvas
- ~(-1)为何是0?
- RMQ(区间求最值)
- django problem_01
- CentOS安装squid代理服务器
- leetcode Search in Rotated Sorted Array
- 2014、10,25 自己试着用JAVA写一些东西
- linux下vi命令大全
- start:从csdn博客看用户体验
- 四川大学线下编程比赛第二题:Peter的X
- uva 10465(背包问题)
- 数字集成电路设计-15-DPI(续)
- 范冰冰着大仁哥新装出街 款款皆真爱
- mac/windows/linux中eclipse搭建Android开发环境,无法访问dl-ssl.google.com