搜索插入位置 有序数组 - lifengyu360/lifengyu_first_git_test GitHub Wiki

int searchInsert(vector<int>& nums, int target) {

    int i = 0;
    int j = nums.size() - 1;
    while (i <= j){
        int index = (j+i)/2;
        if (nums[index] == target) {
            return index;
        }else if (nums[index] < target){
            i = index + 1;
        }else {
            j = index - 1;
        }
    }

    return i;
}