LeetCode(35)-Search Insert Position

版权声明：XiangYida https://blog.csdn.net/qq_36781505/article/details/83722745

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 4:
Input: [1,3,5,6], 0
Output: 0

题目的意思就是给一个有序数组和一个数看数组中是否存在该数字
若存在返回索引否则就返回插入数组的位置
嗯？这个题也很简单，直接看代码吧，晚安

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

   }