LeetCode--35. Search Insert Position

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/a247027417/article/details/82700055

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

【思路】首先需要做一些特殊情况检测，当nums为空时，插入的直接就在第0个位置，直接返回0.不为空时，直接遍历nums看target<=nums[i]成立时，直接返回i，当没有找到target<=nums的条件是，target直接插入在nums的最后，即nums.length。

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

运行时打败100% submission。