LeetCode 35 Search Insert Position
来源:互联网 发布:萨沙-考恩生涯数据 编辑:程序博客网 时间:2024/06/06 04:30
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
public int searchInsert(int[] nums, int target) {int hight = nums.length, low = 0, mid;while (hight > low) {mid = low + (hight - low) / 2;if (nums[mid] == target) return mid;if (nums[mid] > target)hight = mid;elselow = mid + 1;}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
- 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
- Leetcode#35||Search Insert Position
- 利用iReport制作子报表
- epiceditor_在你的网页嵌入markdown
- php 格式化时间
- 二进制中有多少个1-lintcode
- iOS开发总结之自定义等高cell02-storyboard(封装)
- LeetCode 35 Search Insert Position
- 【解决方法】eclipse debug Unable to install breakpoint in xxx
- 对WIN32中窗口的理解
- Java compiler level does not match the version of the installed Java project
- 1011寻找@
- DES、3DES
- Android SDK Manager无法更新的解决方案
- [网络编程]——UDP
- Volley的使用