Search a 2D Matrix

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.
For example,

Consider the following matrix:

[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.

C++:
01 bool searchMatrix(vector<vector<int> > &matrix, int target) {
02      int n=matrix.size();
03      if(n==0)
04           return false;
05      int m=matrix[0].size();
06      if(m==0)
07          return false;
08      int i=n1;
09      int j=0;
10      int cur=matrix[i][j];
11      while((i>=0)&&(j<m)){
12          if(matrix[i][j]==target)
13               return true;
14          if(matrix[i][j]<target)
15               j++;
16          else
17               i;
18      }
19      return false;
20 }
Advertisements
This entry was posted in Array and linked list, Binary search. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s