The Search a 2D Matrix Java solutions

Source: Internet
Author: User

Write an efficient algorithm, searches for a value in a m x n Matrix. This matrix has the following properties:

    • Integers in each row is sorted from the left to the right.
    • The first integer of each row was greater than the last integer of the previous row.

For example,

Consider the following matrix:

[  [1,   3,  5,  7],  [Ten, One,],  [23, 30, 34, 50]]

Given target = 3 , return true .

1  Public classSolution {2      Public BooleanSearchmatrix (int[] Matrix,inttarget) {3         intm = matrix.length, n = matrix[0].length;4         if(m = = 0 | | n = = 0)return false;5         inti = m-1,j = 0;6          while(I >= 0 && J <N) {7             if(Matrix[i][j] = = target)return true;8             if(Matrix[i][j] > target) i--;9             ElseJ + +;Ten         } One         return false; A     } -}

The matrix of the problem is also characteristic. Comparison topics:


Solution Two: You can use binary search to do, but should not use the characteristics of the matrix to do fast.

The Search a 2D Matrix Java solutions

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.