题目链接：LeetCode 74 — Search a 2D Matrix
AC代码：
public class PRoblem74 { public static void main(String[] args) { } // TODO Auto-generated method stub public boolean searchMatrix(int[][] matrix, int target) { for(int i=0;i<=matrix.length-2;i++){ if(target==matrix[i][0]) return true; else if(target>matrix[i][0]){ if(target==matrix[i+1][0]) return true; else if(target>matrix[i+1][0]) continue; else{ for(int j=1;j<matrix[0].length;j++){ if(matrix[i][j]==target) return true; } return false; } } } for(int j=0;j<matrix[0].length;j++){ if(matrix[matrix.length-1][j]==target) return true; } return false; }}新闻热点
疑难解答
