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 题解
原文：https://www.cnblogs.com/c-supreme/p/8889200.html