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

class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        if(array.size()==0)
        return false;
        int n = array.size();
        if(array[0].size()==0)
        return false;
        int m = array[0].size();
        for(int i = n-1,j = 0;i >= 0 && j < m; )
        {//从左下角开始
            if(target>array[i][j])
            {
                j++;
            }
            else if(target<array[i][j])
            {
                i--;            
            }
            else 
                return true;            
        }
        return false;      
    }
};