代码改变世界

leetcode - Search in Rotated Sorted Array II

2013-11-05 22:48  张汉生  阅读(172)  评论(0)  编辑  收藏  举报

 

 1 class Solution {
 2 public:
 3     bool search(int A[], int n, int target) {
 4         // IMPORTANT: Please reset any member data you declared, as
 5         // the same Solution instance will be reused for each test case.
 6         if (n<=0) // cannot decide which side target should be, so O(n)
 7             return -1;
 8         for (int i=0; i<n; i++)
 9             if (A[i]==target)
10                 return true;
11         return false;
12     }
13 };