LeetCode OJ Search in Rotated Sorted Array II
2015-03-21 18:42
246 查看
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
class Solution { public: bool search(int A[], int n, int target) { int l = 0, r = n - 1; while (l <= r) { int m = l + (r - l) / 2; if (A[m] == target) return true; if (A[l] < A[m]) { if (A[l] <= target && target < A[m]) r = m - 1; else l = m + 1; } else if (A[l] > A[m]) { if (A[m] < target && target <= A[r]) l = m + 1; else r = m - 1; } else {l++;} } return false; } };
相关文章推荐
- Leetcode 81. Search in Rotated Sorted Array II
- [Leetcode] Search in Rotated Sorted Array II
- LeetCode : Search in Rotated Sorted Array II
- [LeetCode]81 Search in Rotated Sorted Array II
- [Leetcode] search in rotated sorted array ii 搜索旋转有序数组
- leetcode-Search in Rotated Sorted Array II
- 《leetCode》:Search in Rotated Sorted Array II
- LeetCode-81-Search in Rotated Sorted Array II 水题
- [LeetCode] Search in Rotated Sorted Array II [36]
- Leetcode 81. Search in Rotated Sorted Array II
- Leetcode 81. Search in Rotated Sorted Array II
- LeetCode--Search in Rotated Sorted Array II
- LeetCode081 Search in Rotated Sorted Array II
- [LeetCode]Search in Rotated Sorted Array II
- leetcode 81. Search in Rotated Sorted Array II
- [LeetCode] 098: Search in Rotated Sorted Array II
- Search in Rotated Sorted Array II leetcode java
- [leetcode] 81. Search in Rotated Sorted Array II
- LeetCode-Search in Rotated Sorted Array II
- LeetCode81 Search in Rotated Sorted Array II