标签：style blog http io color ar os for sp
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
For example,
Consider the following matrix:
[ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ]
Given target = 3,
return true.
思路：
从右上角开始，如果等于，则返回TRUE，如果大于二维数组的数字，列--，否则行++;算法和测试用例如下：
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
bool isFound = false;
int rows = matrix.size();
cout << rows << endl;
int columns = matrix.front().size();
cout << columns << endl;
if (rows>0&&columns>0)
{
int row = 0;
int column = columns - 1;
while (row < rows && column >= 0)
{
if (matrix[row][column] == target)
{
isFound = true;
break;
}
else if (matrix[row][column] > target)
{
--column;
}
else
{
++row;
}
}
}
return isFound;
}
};
void main()
{
vector<vector<int> > matrix{ { 1, 2, 8, 9 }, { 2, 4, 9, 12 }, { 4, 7, 10, 13 }, {6,8,11,15} };
Solution s;
bool isFound = s.searchMatrix(matrix, 121);
cout << isFound << endl;
system("pause");
}
标签：style blog http io color ar os for sp
原文地址：http://blog.csdn.net/eeeduo/article/details/40825625
