LeetCode 35. Search Insert Position
来源:互联网 发布:office卸载软件 编辑:程序博客网 时间:2024/06/08 19:57
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.
int searchInsert(vector<int>& nums, int target) { if (nums.size() == 0) return 0; int low = 0, high = nums.size() - 1, mid; while (low <= high) { mid = (low + high) / 2; if (nums[mid] < target) low = mid + 1; else if (nums[mid] > target) high = mid - 1; else return mid; } //此时low>high return low; }
阅读全文
0 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
- 英语面试
- 【JavaScript】欺骗词法的eval、with与catch及其性能问题
- 【C#】C#总结
- python 字典支持交集和并集操作
- java面试宝典大全(上)
- LeetCode 35. Search Insert Position
- 解决sublime text无法安装插件问题
- D3.js version4教程(3)
- 算法提高 金明的预算方案 有依赖的背包问题
- Visual Studio 秘钥
- 实现摄像头内容的网页播放
- D3.js version4教程(4)
- 【JAVA基础】枚举(enum)用法
- 由一个简单例子上手neon