Search a 2D Matrix II
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 in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following matrix:
[
[1, 4, 7, 11, 15],
[2, 5, 8, 12, 19],
[3, 6, 9, 16, 22],
[10, 13, 14, 17, 24],
[18, 21, 23, 26, 30]
]
Given target = 5, return true.
Given target = 20, return false.
思路:用杨氏三角,从右上角进行比较,如果比target大,删除该列;如果比target小,删除该行。编程之美上面有类似的题目。
#include <stdlib.h>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
class Solution {
public:
bool searchMatrix(vector<vector<int> >& matrix, int target) {
int row = matrix.size();
int col = matrix[0].size();
if( row == 0 || col == 0 ) return false;
int x = 0, y = col-1;
while ( x < row && y >= 0 )
{
if(matrix[x][y] == target)
return true;
else if(matrix[x][y]>target)
y--;
else
x++;
}
return false;
}
};
int main(){
vector <vector <int> > array(5);
for(int i=0;i <5;i++)
array[i].resize(5);
int temp[5][5]={
{1, 4, 7, 11, 15},
{2, 5, 8, 12, 19},
{3, 6, 9, 16, 22},
{10, 13, 14, 17, 24},
{18, 21, 23, 26, 30}};
for(int i = 0; i < 5; i++)
for(int j = 0; j < 5; j++)
array[i][j]=temp[i][j];
Solution a;
cout<<a.searchMatrix(array,20)<<endl;
return 0;
}