LeetCode第35题:Search Insert Position(Java详解)

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

题目解析:
直接遍历即可,找到位置即可,注意二种特殊情况:
1.数组长度为0;
2.目标值大于数组中最后一个值。

代码:

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

性能:
LeetCode第35题:Search Insert Position(Java详解)_第1张图片

总结:哈哈,题目太简单,提交人数太少,性能都无法排名。自勉!

你可能感兴趣的:(Java)