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.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

很簡單，沒的說。

class Solution { public:int searchInsert(vector<int>& nums, int target) {int ans=lower_bound(nums.begin(),nums.end(),target)-nums.begin();return ans;} };

?

轉(zhuǎn)載于:https://www.cnblogs.com/zywscq/p/5216205.html

總結(jié)

以上是生活随笔為你收集整理的leetcode 35 Search Insert Position(二分法)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。