[LeetCode]35. Search Insert Position

https://leetcode.com/problems/search-insert-position/

简单二分

public class Solution {    public int searchInsert(int[] nums, int target) {        int beg = 0;        int end = nums.length - 1;        // 二分查找，注意下<=        // 注意end = mid是否减一，beg = mid是否加一        while (beg <= end) {            int mid = beg + (end - beg) / 2;            if (nums[mid] == target) {                return mid;            } else if (nums[mid] > target) {                end = mid - 1;            } else {                beg = mid + 1;            }        }        return beg;    }}