LeetCode/Java/704.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
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
    public int search(int[] nums, int target) {
        int lo = 0;
		int hi = nums.length - 1;

		while(lo + 1 < hi) {
			int mid = lo + (hi - lo) / 2;
			if(nums[mid] == target)
				return mid;
			else if(nums[mid] < target)
				lo = mid;
			else hi = mid;
		}
		return nums[lo] == target ? lo : (nums[hi] == target ? hi: - 1);

    }
}
__________________________________________________________________________________________________
sample 37264 kb submission
class Solution {
    public int search(int[] nums, int target) {
        int index = -1;
        // if(target < nums.length){
            Arrays.stream(nums).anyMatch(number -> number == target);
            for(int i = 0;i<nums.length;i++) {
                if(nums[i] == target){
                    index = i;
                    break;
                }
            // }
        }
        return index;
    }
}
__________________________________________________________________________________________________