240. Searching 2D Matrix II

---

Foreword

Write an efficient algorithm to search for a target value target in the m x n matrix matrix .The matrix has the following properties:

The elements of each row are arranged in ascending order from left to right.
The elements of each column are arranged in ascending order from top to bottom.

Source: LeetCode
Link: https://leetcode.cn/problems/search-a-2d-matrix-ii
The copyright belongs to Linking.com.For commercial reprints, please contact the official authorization, and for non-commercial reprints, please indicate the source.

Solution ideas

Classic solution: .
Start from the upper right corner
If the current number is greater than the target
Then find it from the left

If the current number is less than the target number, look down

Code

class Solution {public boolean searchMatrix(int[][] matrix, int target) {int row=0;int col=matrix[0].length-1span>;while(row<matrix.length&&col>=0){if(matrix[row][col]==target){return true;}else if(matrix[row][col]>target){col--;}else{row++;}}return false;}}