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