LeetCode/Java/1064.java at master · strengthen/LeetCode · 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
__________________________________________________________________________________________________
sample 37932 kb submission
public class Solution {

	public int fixedPoint(int[] a) {
		int lo = 0;
		int hi = a.length - 1;

		while (lo < hi) {
			int mid = lo + (hi - lo) / 2;
			if (a[mid] > mid) {
				hi = mid - 1;
			} else {
				lo = mid + 1;
			}
		}

		while (lo > 0 && a[lo - 1] == lo - 1) {
			lo--;
		}

		return a[lo] == lo ? lo : -1;
	}

}
__________________________________________________________________________________________________
sample 37940 kb submission
class Solution {
    public int fixedPoint(int[] A) {
        for (int i = 0; i < A.length; i++) {
            if (A[i] == i) return i;
        }
        return -1;
    }
}
__________________________________________________________________________________________________
sample 37980 kb submission
class Solution {
    public int fixedPoint(int[] nums) {
        int lo = 0, hi = nums.length - 1;
        while (lo <= hi) {
            int mid = lo + (hi - lo) / 2;
            if (nums[mid] < mid) {
                lo = mid + 1;
            } else if (nums[mid] > mid) {
                hi = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}