LeetCode 35 搜索插入位置(JAVA)

最为简单的二分查找题目:

class Solution {
    public int searchInsert(int[] nums, int target) {
        // 判断特例
        int len = nums.length;
        if (null == nums || len == 0)
            return 0;
        // 二分查找
        int left = 0;
        int right = len;

        // 套用模板
        while (left < right) {
            int mid = left + ((right - left) >> 1);
            // 判断
            if (nums[mid] < target)
                left = mid + 1;
            else if (nums[mid] == target)
                return mid;
            else
                right = mid;

        }
        return left;
    }
}