* Definition for an interval.
* public class Interval {
* Interval() { start = 0; end = 0; }
* Interval(int s, int e) { start = s; end = e; }
public int[] findRightInterval(Interval[] intervals) {
if (intervals == null || intervals.length == 0) {
int n = intervals.length;
List<Integer> startPoints = new ArrayList<>();
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++) {
startPoints.add(intervals[i].start);
map.put(intervals[i].start, i);
Collections.sort(startPoints);
for (int i = 0; i < n; i++) {
int start = binarySearch(startPoints, intervals[i].end);
if (start < intervals[i].end) {
public int binarySearch(List<Integer> list, int target) {
int start = 0, end = list.size() - 1, mid = 0;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (list.get(mid) < target) {
if (list.get(start) >= target) {