Leetcode刷题记—— 35. Search Insert Position(查找插入位置)
2016-12-29 19:42
453 查看
一、题目叙述:
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.
Subscribe to see which companies asked this question
给定一个已排序数组,和一个目标值,要求:若数组中存在该值返回该值位置;不存在,返回该值应插入的位置。
二、解题思路:
使用二分查找,稍加考虑各种情况即可。
(1)若找到目标值,返回其位置坐标
(2)若发现比目标值大,更新mid值,特殊情况,当mid == lo时,即最小值都比目标值大,返回0;
(3)若发现比目标值小,查看其后一个数字是否比目标值大,若是,mid + 1即为要插入的位置(特殊情况:当mid == hi时,即最大值都比目标值小时,直接返回mid + 1 防止数组越界)。
三、源码:
public class Solution
{
public int searchInsert(int[] nums, int target)
{
int lo = 0;
int hi = nums.length - 1;
while (lo <= hi)
{
int mid = lo + (hi - lo) / 2;
if (nums[mid] == target) return mid;
else if (nums[mid] > target)
{
if (mid == lo) return lo;
hi = mid - 1;
}
else
{
if (mid == hi) return hi + 1;
if (nums[mid + 1] > target)
return mid + 1;
else lo = mid + 1;
}
}
return 0;
}
public static void main(String args[])
{
int[] nums = {};
int target = 7;
Solution solution = new Solution();
System.out.println(solution.searchInsert(nums, target));
}
}
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
Subscribe to see which companies asked this question
给定一个已排序数组,和一个目标值,要求:若数组中存在该值返回该值位置;不存在,返回该值应插入的位置。
二、解题思路:
使用二分查找,稍加考虑各种情况即可。
(1)若找到目标值,返回其位置坐标
(2)若发现比目标值大,更新mid值,特殊情况,当mid == lo时,即最小值都比目标值大,返回0;
(3)若发现比目标值小,查看其后一个数字是否比目标值大,若是,mid + 1即为要插入的位置(特殊情况:当mid == hi时,即最大值都比目标值小时,直接返回mid + 1 防止数组越界)。
三、源码:
public class Solution
{
public int searchInsert(int[] nums, int target)
{
int lo = 0;
int hi = nums.length - 1;
while (lo <= hi)
{
int mid = lo + (hi - lo) / 2;
if (nums[mid] == target) return mid;
else if (nums[mid] > target)
{
if (mid == lo) return lo;
hi = mid - 1;
}
else
{
if (mid == hi) return hi + 1;
if (nums[mid + 1] > target)
return mid + 1;
else lo = mid + 1;
}
}
return 0;
}
public static void main(String args[])
{
int[] nums = {};
int target = 7;
Solution solution = new Solution();
System.out.println(solution.searchInsert(nums, target));
}
}
相关文章推荐
- LeetCode 35. Search Insert Position(查找插入位置)
- leetcode 35. Search Insert Position搜索插入位置(二分查找)
- LeetCode---35. Search Insert Position(查找插入位置)
- LeetCode | Search Insert Position(查找插入位置)
- LeetCode Search Insert Position查找插入位置
- Leetcode 35 Search Insert Position 二分查找插入数字位置
- LeetCode 35 Search Insert Position(查找插入位置)
- 【LeetCode】- Search Insert Position(查找插入的位置)
- 【LeetCode】- Search Insert Position(查找插入的位置)
- [Leetcode] search insert position 寻找插入位置
- [LeetCode] Search Insert Position 搜索插入位置
- [LeetCode]24. Search Insert Position插入位置
- LeetCode OJ:Search Insert Position(查找插入位置)
- [LeetCode]—Search Insert Position 有序数组中找目标插入的位置
- 【LeetCode-面试算法经典-Java实现】【035-Search Insert Position(搜索插入位置)】
- [LeetCode] Search Insert Position 搜索插入位置
- LeetCode-35-Search Insert Position(搜素并插入指定位置)
- LeetCode-35:Search Insert Position(寻找或插入位置)
- LeetCode OJ 之 Search Insert Position (查找插入位置)
- Search insert position, 查找插入位置