leetcode-- 35. Search Insert Position
2017-04-18 15:22
323 查看
传送门
方法一:
方法二:int searchInsert(vector<int>& nums, int target) {
for(int i=0;i<nums.size();i++){
if(target == nums[i]) return i;
if(target<nums[i]&&target>nums[i-1])return i;
if(target <nums[0]) return 0;
if(target >nums[nums.size()-1]) return nums.size();
}
}
方法一:
int searchInsert(int* nums, int numsSize, int target) { int i=0; while(target>nums[i]&&i<numsSize){ i++; } return i; }
方法二:int searchInsert(vector<int>& nums, int target) {
for(int i=0;i<nums.size();i++){
if(target == nums[i]) return i;
if(target<nums[i]&&target>nums[i-1])return i;
if(target <nums[0]) return 0;
if(target >nums[nums.size()-1]) return nums.size();
}
}
相关文章推荐
- LeetCode之路——LeetCode_35_ Search Insert Position
- LeetCode(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
- python写算法题: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
- LeetCode 35 Search Insert Position(查找插入位置)
- LeetCode | 35. Search Insert Position
- [leetcode]-35. Search Insert Position(C语言)
- LeetCode(35) Search Insert Position
- leetcode 35:Search Insert Position
- python实现 LeetCode35——Search Insert Position
- Leetcode35: Search Insert Position