LeetCode Arrary Easy 35. Search Insert Position 题解

Description

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

Problem-solving idea: When the value of the current index is less than the target value, the index is incremented. Determine the value of the index in the while loop to prevent the array index from going out of bounds

C# code:

public class Solution {
    public int SearchInsert(int[] nums, int target) {
        if(nums.Length == 0)
            return 0;
        int index = 0;
        while(nums[index] < target){
            index++;
            if(index == nums.Length)
                break;
        }
        return index;
    }
}

Begin to get used to the problem description and problem solving specification of LeetCode gradually. keep going