算法--------矩阵查找

给定M×N矩阵，每一行、每一列都按升序排列，请编写代码找出某元素。

示例:

现有矩阵 matrix 如下：

[
[1, 4, 7, 11, 15],
[2, 5, 8, 12, 19],
[3, 6, 9, 16, 22],
[10, 13, 14, 17, 24],
[18, 21, 23, 26, 30]
]
给定 target = 5，返回 true。

给定 target = 20，返回 false。

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
                             
           for(int i=0;i<matrix.length;i++){
               for(int j=0;j<matrix[i].length;j++){
                  if(matrix[i][j] == target){
                           return true;
                  }
                  
               }
           }
           return false;
    }
    public static void  main (String[] args){
        int[][] nums={{1, 4,  7, 11, 15},
                        {2, 5,  8, 12, 19},
                        {3, 6,  9, 16, 22},
                        {10, 13, 14, 17, 24},
                        {18, 21, 23, 26, 30}};
        Solution s = new Solution();
        s.searchMatrix(nums,20);

    }
}