剑指offer面试题--二维数组的查找

代码实现：

class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        int row = array.size();
        int col = array.at(0).size();
        if(row>0&&col>0)
        {
             int i = 0;
             int j = col-1;
            while(i<row && j>=0 )
            {
                if(array[i][j] == target)
                {
                    return true;
                }
                else if(array[i][j]>target)
                {
                    j--;
                }
                else{
                    i++;
                }
            }
            return false;
        }
        return false;
    }
};