leetcode-java/src/SearchA2DMatrix74.java at master · fluency03/leetcode-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
/**
 * Write an efficient algorithm that searches for a value in an m x n matrix.
 * This matrix has the following properties:
 *
 * Integers in each row are sorted from left to right.
 * The first integer of each row is greater than the last integer of the previous row.
 *
 * Example 1:
 * Input:
 * matrix = [
 *   [1,   3,  5,  7],
 *   [10, 11, 16, 20],
 *   [23, 30, 34, 50]
 * ]
 * target = 3
 * Output: true
 *
 * Example 2:
 * Input:
 * matrix = [
 *   [1,   3,  5,  7],
 *   [10, 11, 16, 20],
 *   [23, 30, 34, 50]
 * ]
 * target = 13
 * Output: false
 */

public class SearchA2DMatrix74 {
    public boolean searchMatrix(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return false;
        int start = 0;
        int end = matrix.length - 1;
        while (start < end) {
            int mid = start + (end - start + 1) / 2;
            if (matrix[mid][0] == target) return true;
            if (matrix[mid][0] < target) {
                start = mid;
            } else {
                end = mid - 1;;
            }
        }
        int row = start;
        start = 0;
        end = matrix[0].length - 1;
        while (start < end) {
            int mid = start + (end - start) / 2;
            if (matrix[row][mid] == target) return true;
            if (matrix[row][mid] > target) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        return matrix[row][start] == target;
    }


    public boolean searchMatrix2(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return false;
        int start = 0;
        int end = matrix.length - 1;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (matrix[mid][0] == target) return true;
            if (matrix[mid][0] < target) {
                start = mid;
            } else {
                end = mid - 1;;
            }
        }
        int row = target >= matrix[end][0] ? end : start;
        start = 0;
        end = matrix[0].length - 1;
        while (start < end) {
            int mid = start + (end - start) / 2;
            if (matrix[row][mid] == target) return true;
            if (matrix[row][mid] > target) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        return matrix[row][start] == target;
    }


    public boolean searchMatrix3(int[][] matrix, int target) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return false;
        int M = matrix.length;
        int N = matrix[0].length;
        int start = 0;
        int end = M * N - 1;
        while (start < end) {
            int mid = start + (end - start) / 2;
            int midVal = matrix[mid / N][mid % N];
            if (midVal == target) return true;
            if (midVal < target) {
                start = mid + 1;
            } else {
                end = mid - 1;
            }
        }
        return matrix[start / N][start % N] == target;
    }

}