剑指offer JZ1 二维数组的查找

 1 class Solution {
 2 public:
 3     bool Find(int target, vector<vector<int> > array) {
 4         bool findTarget = 0;
 5         
 6         for(int i=0; i<array.size(); i++){
 7             int low = 0;
 8             int len = array[i].size();
 9             int high = len - 1;
10             
11             while(low <= high){
12                 int mid = low + ((high - low)>>1);
13                 if( target == array[i][mid]){
14                     findTarget = 1;
15                 }else if(target > array[i][mid]){
16                     low = mid + 1;
17                 }else{
18                     high = mid - 1;
19                 }
20                 if(findTarget) break;
21             }
22             if(findTarget) break;
23         }
24         
25         return findTarget;
26     }
27 };