赞
踩
题目:
题解:
- bool searchMatrix(int** matrix, int matrixSize, int* matrixColSize, int target) {
- int m = matrixSize, n = matrixColSize[0];
- int low = 0, high = m * n - 1;
- while (low <= high) {
- int mid = (high - low) / 2 + low;
- int x = matrix[mid / n][mid % n];
- if (x < target) {
- low = mid + 1;
- } else if (x > target) {
- high = mid - 1;
- } else {
- return true;
- }
- }
- return false;
- }
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。