LeetCode 35. Search Insert Position
2017-04-17 23:52
579 查看
Description
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
Code
class Solution { public: int searchInsert(vector<int>& nums, int target) { for (int i = 0; i < nums.size(); i++) if (nums[i] >= target) return i; return nums.size(); } };
Appendix
Link: https://leetcode.com/problems/search-insert-position/Run Time: 6ms
相关文章推荐
- leetcode35. Search Insert Position
- leetcode 35. Search Insert Position
- leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- leetcode 35. Search Insert Position
- 【LeetCode】35. Search Insert Position
- LeetCode 35. Search Insert Position
- Leetcode35. Search Insert Position
- leetcode_35. Search Insert Position
- leetcode 35. Search Insert Position
- Leetcode 35. Search Insert Position (Medium) (java)
- 【LeetCode】35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode35. Search Insert Position
- Leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- Leetcode 35. Search Insert Position
- [leetcode]35. Search Insert Position
- LeetCode-35.Search Insert Position
- leetcode刷题记录-35. Search Insert Position