标签：
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.
class Solution { public: bool searchMatrix(vector<vector<int> > &matrix, int target) { if(matrix.empty()) return false; int columns = matrix[0].size()-1; int line; for(line = 0; line < matrix.size(); line++){ if(target <= matrix[line][columns]) break; } if(line == matrix.size()) return false; else return findColumn(matrix[line],target,0,columns); } bool findColumn(vector<int>& array, int target,int start, int end){ int mid = start + (end - start)/2; if(target == array[mid]) return true; if(target < array[mid]){ if(mid == start) return false; else findColumn(array, target, start,mid-1); } else{ if(mid == end) return false; else findColumn(array, target, mid+1,end); } } };
74. Search a 2D Matrix (Graph; Divide-and-Conquer)
标签：
原文地址：http://www.cnblogs.com/qionglouyuyu/p/4854625.html
