Search Insert Position

**Description**Hints**Submissions**Solutions

Total Accepted: 171574 Total Submissions: 434381 Difficulty: Easy Contributor: LeetCode

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. Here are few examples. [1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16

    public int searchInsert(int[] nums, int target) {
      int start = 0, end = nums.length - 1;
      // [1, 3, 5, 6]  target = 2, 
      // A[start] = A[end] = A[0] = 1 < Target,  start = mid + 1 = 1 > end , out of loop, Then  return start = 1;
      while (start <= end) {
          int mid = start + (end - start) / 2;
          if (nums[mid] == target) {
              return mid;
          } else if (nums[mid] < target) {
              start = mid + 1;
          } else {
              end = mid - 1;
          }
      }
      return start;
    }