Leetcode---35. Search Insert Position
2017-10-22 10:09
435 查看
Description:
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.
Solution:
https://leetcode.com/submissions/detail/124703934/
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
Solution:
https://leetcode.com/submissions/detail/124703934/
class Solution { public int searchInsert(int[] nums, int target) { int low = 0, high = nums.length -1; int mid; while(low <= high){ mid = low + (high -low)/2; if(nums[mid] == target){ return mid; } if(nums[mid] < target) { low = mid + 1; } else { high = mid -1 ; } } return low; } }
相关文章推荐
- 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 (C,C++,Java,Python)
- 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
- Java [leetcode 35]Search Insert Position