# LeetCode - 0035. Search Insert Position
### 題目網址：https://leetcode.com/problems/search-insert-position/
###### tags: `LeetCode` `Easy` `二分搜尋法（Binary Search）`

/*
    -LeetCode format-
    Problem: 35. Search Insert Position
    Difficulty: Easy
    
    by Inversionpeter
*/



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