35. Search Insert Position

luozhiyun

发布于 2019-09-10 18:46:05

1800

发布于 2019-09-10 18:46:05

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

Input: [1,3,5,6], 0
Output: 0

class Solution {
    public int searchInsert(int[] nums, int target) {
        if(target<nums[0]){
            return 0;
        }
        if(target>nums[nums.length-1]){
            return nums.length;
        }
        for(int i = 0;i<nums.length;i++){
            if(target == nums[i]){
                return i;
            }
            
            if(i+1<nums.length && nums[i]<target && nums[i+1]>target){
                return i+1;
            }
        }
        return 0;
    }
}

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-01-23 ，如有侵权请联系 cloudcommunity@tencent.com 删除

duplicates