81 Search in Rotated Sorted Array II
2017-10-17 17:12
232 查看
81 Search in Rotated Sorted Array II
Search in Rotated Sorted Array II本题是前一个的变式,如果数组中有重复的元素该怎么办。即出现了第三种情况,有相等的情况,然后就是更新边界元素。
本题是布尔变量,只能用true or false。
class Solution { public boolean search(int[] A, int target) { int l=0; int r=A.length-1; while(l<=r){ int mid=(l+r)/2; if(A[mid]==target) return true; if(A[l]<A[mid]){ if(A[l]<=target && target<=A[mid]) r=mid-1; else l=mid+1; } else if(A[l]>A[mid]){ if(A[mid]<target && target<=A[r]) l=mid+1; else r=mid-1; } else{ l++; } } return false; } }
本文是一短路就把原文给更改丢失了,然后仿佛一个智障补的博客。默哀。
相关文章推荐
- Leetcode 81 Search in Rotated Sorted Array II
- [leetcode]@python 81. Search in Rotated Sorted Array II
- [LeetCode] 81. Search in Rotated Sorted Array II
- [leetcode] 81. Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- leetcode-81-Search in Rotated Sorted Array II 查找
- LeetCode(33)(81) Search in Rotated Sorted Array I II
- leetcode 81: Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- [leetcode]81. Search in Rotated Sorted Array II
- [leetcode] 81. Search in Rotated Sorted Array II
- leetcode || 81、Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- Middle-题目48:81. Search in Rotated Sorted Array II
- leecode 解题总结:81. Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- 81. Search in Rotated Sorted Array II
- Binary Search:81. Search in Rotated Sorted Array II