// 二分法
int searchInsert(int* nums, int numsSize, int target){
    int left = 0, right = numsSize - 1, ans = numsSize;
    while (left <= right) {
        int mid = ((right - left) >> 1) + left;
        if (target <= nums[mid]) {
            ans = mid;
            right = mid - 1;
        } else {
            left = mid + 1;
        }
    }
    return ans;
}

#暴力法
class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        i=0
        while i < len(nums):
            if target <= nums[i]:
                return i
            i+=1
        return i

#直接用python语法……          
class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        nums.append(target)
        nums.sort()
        return nums.index(target)