35. Search Insert Position
Problem:
这道题不能取end的原因是,如果设end = mid - 1,那么end有可能为负。
--------------------------------------------------------------------------------------------------------------------------
Analysis:
After trial for several times, the start = mid + 1 template wins and end should at nums.length
Solution:
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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 08/23/2018 update:
这道题不能取end的原因是,如果设end = mid - 1,那么end有可能为负。
--------------------------------------------------------------------------------------------------------------------------
Analysis:
After trial for several times, the start = mid + 1 template wins and end should at nums.length
Solution:
class Solution { public int searchInsert(int[] nums, int target) { int start = 0, end = nums.length; while (start < end) { int mid = start + (end - start) / 2; if (nums[mid] == target) return mid; else if (nums[mid] < target) start = mid + 1; else end = mid; } return start; } }
评论
发表评论