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

public class Solution {
    public boolean Find(int target, int [][] array) {
        int rows = array.length;
        int cols = array[0].length;
        int i, j;
        for (int row = rows - 1, col = 0; row >= 0 && row < rows && col >= 0 &&
                col < cols;) {
            if (array[row][col] == target) return true;
            if (array[row][col] < target) {
                col++;
                continue;
            }
            if (array[row][col] > target) {
                row--;
                continue;
            }
        }
        return false;
    }
}

解题思想：双指针