题解 | #矩阵元素查找#

import java.util.*;

public class Solution {
    public int[] findElement(int[][] mat, int n, int m, int x) {
        // write code here
        if (mat == null || mat.length < 1 || mat[0] == null || mat[0].length < 1) {
            return new int[0];
        }
        int i = 0;
        int j = m - 1;
        while (i < n && j >= 0) {
            if (mat[i][j] == x) {
                return new int[] {i, j};
            } else if (mat[i][j] > x) {
                j--;
            } else {
                i++;
            }
        }
        return new int[0];
    }
}