题解 | #二维数组中的查找#

#include <vector>
class Solution {
  public:
    bool Find(int target, vector<vector<int> > array) {
	  	//顺序查找+折半查找O
        if(array[0].size()==0){
            return false;
        }

        int left,right,mid;
        for (int i = 0; i < array.size(); i++) {
            vector<int> v = array[i];
            left=0;
            right=array[0].size();
            while (left <= right) {                
                mid = (left + right) / 2;
                if (target < v[mid]) {
                    right = mid - 1;
                } else if (target > v[mid]) {
                    left = mid + 1;
                } else {
                    return true;
                }
            }
        }
	  
        return false;
    }
};