首页 > 代码库 > [leetcode-35-Search Insert Position]
[leetcode-35-Search Insert Position]
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
int searchInsert(vector<int>& nums, int target) { int len = nums.size(); if (len == 0 || nums[0]>=target)return 0; for (int i = 1; i < len;i++) { if (nums[i]==target) return i; if (nums[i]>target && target>nums[i - 1])return i; } return len; }
[leetcode-35-Search Insert Position]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。