Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 35. Search Insert Position

---

題目：


解答：

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int l = 0;
        int r = nums.size() - 1;

        while (l <= r) {
            int m = l + ((r - l) >> 1);

            if (nums[m] == target) {
                return m;
            }

            if (nums[m] < target) {
                l = m + 1;
            }
            else {
                r = m - 1;
            }
        }

        return l;
    }
};