Method searchInsert

src/com/blankj/easy/_0035/Solution.java:12–20

(int[] nums, int target)

 */
public class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1, mid = (right + left) >> 1;
        while (left <= right) {
            if (target <= nums[mid]) right = mid - 1;
            else left = mid + 1;
            mid = (right + left) >> 1;
        }
        return left;
    }

    public static void main(String[] args) {
        Solution solution = new Solution();