LeetCode刷题之 35. Search Insert Position

1. Description

Given a sorted array of distinct integers 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.

2.Test Cases

Example 1:

Input: nums = [1,3,5,6], target = 5
Output: 2

Example 2:

Input: nums = [1,3,5,6], target = 2
Output: 1

Example 3:

Input: nums = [1,3,5,6], target = 7
Output: 4

Example 4:

Input: nums = [1,3,5,6], target = 0
Output: 0

Example 5:

Input: nums = [1], target = 0
Output: 0

3.Soultion

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