【LeetCode】- Search Insert Position（查找插入的位置）

[ 问题: ]

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

注意：一定要考虑一些特殊情况，如数组为null等。

[ 解法: ]

①. 常规解法：从数组索引为0的位置開始找，时间复杂度为O(n)，accepted

public class Solution {public int searchInsert(int[] A, int target) {if (A != null) {for (int i = 0; i < A.length; i++) {if (target == A[i] || target < A[i]) {return i;} }return A.length;}return -1;}public static void main(String[] args) {int[] arr = { 1, 3, 5, 6 };System.out.println(new Solution().searchInsert(arr, 5)); // 5 -> 2System.out.println(new Solution().searchInsert(arr, 2)); // 2 -> 1System.out.println(new Solution().searchInsert(arr, 7)); // 7 -> 4System.out.println(new Solution().searchInsert(arr, 0)); // 0 -> 0}
}

②. 二分查找：时间复杂度log2n

前提条件：一定是有序数组。

public class Solution {public int searchInsert(int[] A, int target) {int mid;int low = 0;int high = A.length - 1;while (low < high) {mid = (low + high) / 2;if (A[mid] < target) {low = mid + 1; } else if (A[mid] > target) {high = mid - 1;} else {return mid;}}return target > A[low] ? low + 1 : low;}public static void main(String[] args) {int[] arr = { 1, 3, 5, 6 };System.out.println(new Solution().searchInsert(arr, 5)); // 5 -> 2System.out.println(new Solution().searchInsert(arr, 2)); // 2 -> 1System.out.println(new Solution().searchInsert(arr, 7)); // 7 -> 4System.out.println(new Solution().searchInsert(arr, 0)); // 0 -> 0}
}

【LeetCode】- Search Insert Position（查找插入的位置）相关推荐

leetcode -- Search Insert Position
2019独角兽企业重金招聘Python工程师标准>>> Search Insert Position Given a sorted array and a target value, ...
LeetCode Search Insert Position （二分查找）
题意: 给一个升序的数组,如果target在里面存在了,返回其下标,若不存在,返回其插入后的下标. 思路: 来一个简单的二分查找就行了,注意边界. 1 class Solution { 2 publi ...
LeetCode --Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
Leetcode:Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
[LeetCode] Search Insert Position 搜索插入位置
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
[LeetCode]Search Insert Position
原题链接:http://oj.leetcode.com/problems/search-insert-position/ 题意描述: Given a sorted array and a target ...
LeetCode - 35. Search Insert Position
35. Search Insert Position Problem's Link ---------------------------------------------------------- ...
LeetCode算法入门- Search Insert Position -day19
LeetCode算法入门- Search Insert Position -day19 题目描述 Given a sorted array and a target value, return the ...
【二分法】LeetCode 35. Search Insert Position
LeetCode 35. Search Insert Position Solution1:我的答案 class Solution { public:int searchInsert(vector&l ...
leetcode python3 简单题35. Search Insert Position
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第三十五题 (1)题目英文: Given a sorted array and a ...

【LeetCode】- Search Insert Position（查找插入的位置）

【LeetCode】- Search Insert Position（查找插入的位置）相关推荐

最新文章

热门文章