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

解題思路：在當前索引的值小於目標值時，索引遞增。在while循環中判斷索引的值，防止數組索引越界

C#代碼：

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;
    }
}

開始漸漸習慣了LeetCode的題目描述和解題規範。繼續加油

LeetCode Arrary Easy 35. Search Insert Position 題解