每日一题:74. 搜索二维矩阵

解题思路

= =暴力遍历了一下 因行列范围都不过100
等下再写个改进版本

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int n = matrix[0].length,m = matrix.length;
        for (int i=0;i<m;i++){
            for (int j=0;j<n;j++){
                if (matrix[i][j]==target){
                    return true;
                }
            }
        }
        return false;
    }
}