《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

解析：该题目一看就像是插入排序的思路。不过我们可以通过观察测试用例来做。分4种情况讨论：
1.target<=最小值；
2.target==最大值；
3.target>最大值；
4.target介于最小值与最大值之间
需要分两种情况
（1）target==当前值，直接返回当前值的下标；
（2）target>当前值，小于下一个值，就返回下一个值的下标

public class Solution {public int searchInsert(int[] A, int target) {if(target<=A[0]){//1.target<=最小值；return 0;}else if(target==A[A.length-1]){//2.target==最大值；return A.length-1;}else if(target>A[A.length-1]){//3.target>最大值；return A.length;}else{//target介于最小值与最大值之间for(int i=0;i<A.length-1;i++){if(A[i]==target){//（1）target==当前值，直接返回当前值的下标；return i;}if(target>A[i]&&target<A[i+1]){//（2）target>当前值，小于下一个值，就返回下一个值的下标return i+1;}}}return -1;}
}

《leetcode》search-insert-position相关推荐

【二分法】LeetCode 35. Search Insert Position
LeetCode 35. Search Insert Position Solution1:我的答案 class Solution { public:int searchInsert(vector&l ...
LeetCode - 35. Search Insert Position
35. Search Insert Position Problem's Link ---------------------------------------------------------- ...
leetcode 【 Search Insert Position 】python 实现
题目: Given a sorted array and a target value, return the index if the target is found. If not, return ...
LeetCode T35 Search Insert Position
文章目录题目地址题目描述思路题解题目地址中文:https://leetcode-cn.com/problems/search-insert-position/ 英文:https://lee ...
【LeetCode】- Search Insert Position（查找插入的位置）
[ 问题: ] Given a sorted array and a target value, return the index if the target is found. If not, re ...
leetcode 35 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
1.问题 Given a sorted array and a target value, return the index if the target is found. If not, retur ...
[LeetCode] 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the ...
LeetCode 35. Search Insert Position
题目: Given a sorted array and a target value, return the index if the target is found. If not, return ...
[LeetCode]--35. 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

《leetcode》search-insert-position相关推荐

最新文章

热门文章