zoukankan      html  css  js  c++  java
  • 35. 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.

    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;
        }
    }
    
  • 相关阅读:
    实验报告2
    实验三 网络欺骗技术
    实验3
    心理魔术
    实验报告
    实验4
    实验5
    实验四恶意代码
    网络对抗技术 实验一
    实验二
  • 原文地址:https://www.cnblogs.com/luozhiyun/p/8336582.html
Copyright © 2011-2022 走看看