LeetCode - 35. Search Insert Position(48ms)

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

 class Solution {

 public:

     int searchInsert(vector<int>& nums, int target) {

         int s = nums.size();

         for(int i = ; i < s; i++) {

             if(target <= nums[i]) {

                 return i;

             }

         }

         return s;

     }

 };

巴特西

LeetCode - 35. Search Insert Position(48ms)

最新文章

热门文章