WEI-CHENG CHEN

說明

返回他的索引位置

解法 01：由頭往後

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        for(int i=0;i<nums.size();i++){
            if(target<=nums[i]) return i;
        }
        return nums.size();
    }
};

解法 02：二分搜尋

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