-
Notifications
You must be signed in to change notification settings - Fork 0
/
leetcode315.java
42 lines (41 loc) · 1.08 KB
/
leetcode315.java
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
/*
Solution Method: Binary Search
*/
public class Solution {
public List<Integer> countSmaller(int[] nums) {
Integer[] ans = new Integer[nums.length];
List<Integer> list = new ArrayList<Integer>();
for(int i = nums.length - 1; i >= 0; i--){
int index = findIndex(nums[i],list);
ans[i] = index;
list.add(index,nums[i]);
}
return Arrays.asList(ans);
}
private int findIndex(int target, List<Integer> list){
if(list.size() == 0){
return 0;
}
int start = 0;
int end = list.size() - 1;
if(list.get(end) < target){
return end + 1;
}
if(list.get(start) >= target){
return 0;
}
while(start+1 < end){
int mid = start + (end - start) / 2;
if(list.get(mid) < target){
start = mid + 1;
}
else{
end = mid;
}
}
if(list.get(start) >= target){
return start;
}
return end;
}
}