35. Search Insert Position
2017-09-24 11:13
211 查看
题目
35. Search Insert Position解题思路
找到合适的位置插进去，有几个位置需要注意：terget等于某个数字或第一次大于某个数字，返回该数字的下标
target比所有数字都大，返回数组长度~
具体思路
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if (!nums.size())
return 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] >= target) {
return i;
}
}
return nums.size();
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 35. Search Insert Position
- [LeetCode]problem 35. Search Insert Position
- [leetcode]Binary Search-35. Search Insert Position
- 35. Search Insert Position
- LeetCode 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- [leetcode]35. Search Insert Position(java)
- LeetCode *** 35. Search Insert Position
- leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- 35. Search Insert Position(Java)
- LeetCode 35. Search Insert Position
- [leetcode:python]35.Search Insert Position
- 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- [leetcode]35. Search Insert Position(Java)
- Leetcode 35. Search Insert Position
- 35. Search Insert Position