题解 | #二维数组中的查找#官方解法妙啊

class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        int n = array.size();
        int m = array[0].size();
        int a = 0;
        int b = m - 1;
        while(a < n && b >= 0){
            if(array[a][b] == target){
                return true;
            }
            else if(array[a][b] < target){
                a++;
            }
            else if(array[a][b] > target){
                b--;
            }
        }
        return false;
    }
};