LeetCode | 35. Search Insert Position
来源:互联网 发布:2016年海关进出口数据 编辑:程序博客网 时间:2024/06/07 21:50
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
简单的二分查找,直接贴上代码:
class Solution {public: int searchInsert(vector<int>& nums, int target) { int len = nums.size(); int left = 0, right = len-1; if(nums[len-1] < target) //插在末位 return len; if(nums[0] > target) //插在首位 return 0; while(left <= right) { int mid = (left+right)/2; if(nums[mid] == target) return mid; if(nums[mid] < target) { if(nums[mid+1] > target) return mid+1; else { left = mid+1; } } else right = mid-1; } return -1; }};
阅读全文
1 0
- [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
- Leetcode 35. Search Insert Position
- 35. Search Insert Position LeetCode
- [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
- LeetCode *** 35. Search Insert Position
- leetcode 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- JAVA从基础到精通(数组)
- QT 实现QLabel上的超链接
- 白话空间统计二十四:地理加权回归(八)结果解读(一)
- git遇到的问题
- android NE 分析
- LeetCode | 35. Search Insert Position
- GridView的一些特殊属性:
- python加压解压zip,rar文件
- android intent打开各种文件的方法
- 开发者最常见的十大违规行为,看看你中招了么?
- 【数据结构】中缀表达式求值解法
- java简单题目day2
- JDBC(二)
- 斜率优化DP 与数形结合思想