LeetCode138|搜索插入位置

输入: [1,3,5,6], 5
输出: 2
示例 2:

输入: [1,3,5,6], 2
输出: 1
示例 3:

输入: [1,3,5,6], 7
输出: 4
示例 4:

输入: [1,3,5,6], 0
输出: 0

import java.util.*;
import java.util.stream.Collectors;

/**
 * @author pc
 */
public class SearchInsertTest {
    public static void main(String[] args) {
        int[] array = {1, 3, 5, 6};
        int target = 0;
        int searchInsert = searchInsert(array, target);
        System.out.println("searchInsert = " + searchInsert);
    }

    public static int searchInsert(int[] nums, int target) {
        Set<Integer> set = new LinkedHashSet<>(nums.length);
        for (int num : nums) {
            set.add(num);
        }
        set.add(target);
        List<Integer> list = new ArrayList<>(set);
        List<Integer> collect = list.stream().sorted(Integer::compareTo).collect(Collectors.toList());
        int[] result = new int[collect.size()];
        int i = 0;
        for (int num : collect) {
            result[i++] = num;
        }

        int left = 0;
        int right = list.size() - 1;
        while (left <= right) {
            int mid = (right + left) / 2;
            if (target == result[mid]) {
                return mid;
            } else if (target > result[mid]) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
}