标签：
Write an efficient algorithm that searches for a value in an m x n matrix.
This matrix has the following properties:
Consider the following matrix:
[ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ]
Given target = 3, return true.
和普通二分搜索是一样的
public class Solution { /** * @param matrix, a list of lists of integers * @param target, an integer * @return a boolean, indicate whether matrix contains target */ public boolean searchMatrix(int[][] matrix, int target) { // write your code here if(matrix == null || matrix.length == 0 || matrix[0] == null || matrix[0].length == 0) return false; int m = matrix.length; int n = matrix[0].length; int size = m * n; int left = 0; int right = size - 1; while(left <= right){ int mid = left + (right - left) / 2; int i = mid / n; int j = mid % n; if(matrix[i][j] == target) return true; else if(matrix[i][j] < target) left = mid + 1; else right = mid - 1; } return false; } }
lintcode-easy-Search a 2D Matrix
标签：
原文地址：http://www.cnblogs.com/goblinengineer/p/5249271.html
