Search Insert Position_Leetcode_35
2016-09-10 19:55
459 查看
1 题目
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
2 解法
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
2 解法
public class Solution { public int searchInsert(int[] nums, int target) { int lhs = 0, rhs = nums.length - 1; while(lhs <= rhs){ int mid = lhs + (rhs - lhs) / 2; if(nums[mid] == target){ return mid; }else if(nums[mid] < target){ lhs = mid + 1; }else{ rhs = mid - 1; } } return lhs; } }
相关文章推荐
- [勇者闯LeetCode] 35. Search Insert Position
- LeetCode-35-Search Insert Position 裸lower_bound
- 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
- 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
- [leetcode 35] Search Insert Position
- 【LeetCode】35. Search Insert Position (2 solutions)
- [Leetcode]_35 Search Insert Position
- leetcode question 35:Search Insert Position
- LeetCode-35-Search Insert Position-E
- LeetCode 35 Search Insert Position