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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param target int整型 
     * @param array int整型vector<vector<>> 
     * @return bool布尔型
     */
    bool Find(int target, vector<vector<int> >& array) {
        // write code here

        int size = array.size();

        for(int i = 0 ; i < size; i++){

            int start = 0;int end = array[i].size() - 1,middle;

            while(start <= end){

                middle = start + (end - start)/2;

                if(array[i][middle] == target) return true;
                else if (array[i][middle] < target)  start = middle + 1;
                else end = middle - 1;

            }
        }
         return false;

    }
};