[LeetCode]81 Search in Rotated Sorted Array II
2015-01-04 16:14
603 查看
https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/
http://blog.csdn.net/linhuanmars/article/details/20588511
http://blog.csdn.net/linhuanmars/article/details/20588511
public class Solution { public boolean search(int[] A, int target) { if (A == null || A.length == 0) return false; return find(A, 0, A.length - 1, target); } // O(n) private boolean find(int[] A, int low, int high, int t) { if (low > high) return false; if (low == high) return A[low] == t; int mid = (low + high) / 2; if (A[mid] == t) return true; if (A[mid] > A[low]) { if (A[low] <= t && t < A[mid]) return find(A, low, mid - 1, t); // Left part else return find(A, mid + 1, high, t); } else if (A[mid] < A[low]) { if (t > A[mid] && t <= A[high]) return find(A, mid + 1, high, t); // Right part else return find(A, low, mid - 1, t); } else { return find(A, low + 1, high, t); // Just shift left. } } }
相关文章推荐
- LeetCode --- 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 (2 solutions)
- [LeetCode] Search in Rotated Sorted Array I (33) && II (81) 解题思路
- [Leetcode] 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, Medium] 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(C)
- 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[33&81]:Search in Rotated Sorted Array[I & 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 (旋转数组的搜索II) 解题思路和方法
- LeetCode81——Search in Rotated Sorted Array II