LeetCode 35. Search Insert Position

最新推荐文章于 2025-09-10 15:24:29 发布

weixin_30733003

最新推荐文章于 2025-09-10 15:24:29 发布

阅读量65

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/flowingfog/p/9794691.html

本文详细解析了LeetCode第35题“SearchInsertPosition”的解决方案，介绍了一个寻找目标值在有序数组中插入位置的算法。通过示例说明如何在数组中查找目标值或确定其应插入的位置。

LeetCode 35. Search Insert Position

分析

难度易

来源

https://leetcode.com/problems/search-insert-position/description/

题目

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: 0

解答

 1 package LeetCode;
 2 
 3 public class L35_SearchInsertPosition {
 4     public int searchInsert(int[] nums, int target) {
 5         int pos=0;
 6         int len=nums.length;
 7         if(len==0)
 8             return pos;
 9         else if(len==1){
10             if(nums[0]>=target)
11                 pos=0;
12             else
13                 pos=1;
14         }else{
15             for(int i=0;i<len;i++)
16             {
17                 if(nums[i]<target)
18                     pos++;
19                 else
20                     break;
21             }
22         }
23         return pos;
24     }
25 }