class Solution {
public int searchInsert(int[] nums, int target) {
int n =nums.length;
int low=0;
int high=n-1;
int res=0;
if(target >nums[n-1]){
return n;
}
while(low<=high){
int mid=low+(high-low)/2;
if(nums[mid] < target){
low=mid+1;
}
else if(nums[mid] >= target){
res=mid;
high=mid-1;
}
}
return res;
}
}
Y2xhc3MgU29sdXRpb24gewogICAgcHVibGljIGludCBzZWFyY2hJbnNlcnQoaW50W10gbnVtcywgaW50IHRhcmdldCkgewogICAgICAgIGludCBuID1udW1zLmxlbmd0aDsKCiAgICAgICAgaW50IGxvdz0wOwogICAgICAgIGludCBoaWdoPW4tMTsKICAgICAgICAKICAgICAgICBpbnQgcmVzPTA7CiAgICAgICAgaWYodGFyZ2V0ID5udW1zW24tMV0pewogICAgICAgICAgICAgICByZXR1cm4gbjsKICAgICAgICB9CiAgICAgICAgd2hpbGUobG93PD1oaWdoKXsKICAgICAgICAgICAgaW50IG1pZD1sb3crKGhpZ2gtbG93KS8yOwogICAgICAgICAgICBpZihudW1zW21pZF0gPCB0YXJnZXQpewogICAgICAgICAgICAgICAgbG93PW1pZCsxOwogICAgICAgICAgICB9CiAgICAgICAgICAgIGVsc2UgaWYobnVtc1ttaWRdID49IHRhcmdldCl7CiAgICAgICAgICAgICAgIHJlcz1taWQ7CiAgICAgICAgICAgICAgIGhpZ2g9bWlkLTE7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgcmV0dXJuIHJlczsKICAgIH0KfQ==