38 - 搜索二维矩阵 II

2017.9.19

就是不断缩小检索范围就可以了

public class Solution {
    /*
     * @param matrix: A list of lists of integers
     * @param target: An integer you want to search in matrix
     * @return: An integer indicate the total occurrence of target in the given matrix
     */
	public static int searchMatrix(int[][] matrix, int target) {
	        // write your code here
		int count = 0;
		if(matrix == null){
			return count;
		}
		int n = matrix.length-1;
		if( n < 0 || matrix[0] == null){
			return count;
		}
		int m = matrix[0].length-1;
		if( m < 0){
			return count;
		}
		/**
		 * 1看  matrix[0][i]，如果matrix[0][i] >= target 那么right = i-1;
		 * 2看  matrix[n-1][j] 如果matrix[n-1][j] <= targer 那么 left = j+1;
		 * 3看 matrix[right][k]，如果 matrix[right][k] <= target 那么 up = k + 1；
		 * 4看 matrix[left][h]，如果 matrix[left][h] >= targer 那么down = h-1;
		 *  ****/
		int left = 0;
		int up = 0;
		int right = m;
		int down = n;
		for(int i = 0; i <= m; i++){
			if(matrix[down][i] < target){
				left = i+1;
			}
			if(matrix[up][i] <= target){
				right = i;
			}
		}
		for(int i = 0; i <= n; i++){
			if(matrix[i][right] < target){
				up = i+1;
			}
			if(left <= m && matrix[i][left] <= target){
				down = i;
			}
		}
		for(int i = left; i <= right;i++){
			for(int j = up; j <= down;j++){
				if(matrix[j][i] == target){
					count++;
				}
			}
		}
		return count;	
	}
}