DAY 30
0
AI & Data

## 找LeetCode上簡單的題目來撐過30天啦(DAY30)

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

Example 1:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true

Example 2:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false

Constraints:
• m == matrix.length
• n == matrix[i].length
• 1 <= m, n <= 100
• -104 <= matrix[i][j], target <= 104

``````class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int i,j,k,lenx=matrix[0].length,leny=matrix.length;

for(i=0;i<leny;){
System.out.print("1" +i);
if(target == matrix[i][lenx-1]){
return true;
}
if(target > matrix[i][lenx-1]){
System.out.print(" 2" +i);
i++;
}else{
for(j=0;j<lenx-1;j++){
if(target == matrix[i][j]){
return true;
}
}
i++;
}
}
return false;
}
}

``````

day30心得

### 1 則留言

0

iT邦新手 2 級 ‧ 2021-10-15 02:18:18

New title : AI&Data 要Deep 一點也要懂得Coding，可以看soft的前備刷題