Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
1 class Solution { 2 public: 3 int searchInsert(vector<int>& nums, int target) { 4 int s = nums.size(); 5 for(int i = 0; i < s; i++) { 6 if(target <= nums[i]) { 7 return i; 8 } 9 } 10 return s; 11 } 12 };
内容来源于网络如有侵权请私信删除
- 还没有人评论，欢迎说说您的想法！
客服
