欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页

LeetCode 35. Search Insert Position

程序员文章站 2022-06-09 11:03:18
...

分析

难度 易
来源
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

解答

package LeetCode;

public class L35_SearchInsertPosition {
    public int searchInsert(int[] nums, int target) {
        int pos=0;
        int len=nums.length;
        if(len==0)
            return pos;
        else if(len==1){
            if(nums[0]>=target)
                pos=0;
            else
                pos=1;
        }else{
            for(int i=0;i<len;i++)
            {
                if(nums[i]<target)
                    pos++;
                else
                    break;
            }
        }
        return pos;
    }
} 

相关标签: 笔试