Lintcode - Search in 2D matrix II

Write an efficient algorithm that searches for a value in an m x n matrix, return the occurrence of it.

This matrix has the following properties:

    * Integers in each row are sorted from left to right.

    * Integers in each column are sorted from up to bottom.

    * No duplicate integers in each row or column.

Example

Consider the following matrix:

[

    [1, 3, 5, 7],

    [2, 4, 7, 8],

    [3, 5, 9, 10]

]

Given target = 3, return 2.

Challenge

O(m+n) time and O(1) extra space

    public int searchMatrix(ArrayList<ArrayList<Integer>> matrix, int target) {
        int result = 0;
        int m = matrix.size();
        int n = 0;
        if (m > 0) {
            n = matrix.get(0).size();
        } else {
            return 0;
        }
        int col = 0;
        int row = m-1;
        while (0 <= col && col < n && 0 <= row && row < m) {
            int cur = matrix.get(row).get(col);
            if (cur == target) {
                result++;
                col++;
                row--;
            } else if (cur < target) {
                col++;
            } else {
                row--;
            }
        }
        return result;
    }