标签:
Question :
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
.
bool searchMatrix(int** matrix, int matrixRowSize, int matrixColSize, int target) { int low = 0, high=matrixRowSize*matrixColSize-1; int mid; while(low <= high) { mid = low + (high - low )/2; // avoid to buffer overflow. if(matrix[mid/matrixColSize][mid%matrixColSize] < target) low = mid + 1; else if(matrix[mid/matrixColSize][mid%matrixColSize] > target) high = mid -1; else return true; } return false; }
标签:
原文地址:http://www.cnblogs.com/bittorrent/p/4770442.html