Monday, August 4, 2014

[LeetCode] Search Insert Position


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

Java Code:

public int searchInsert(int[] A, int target) {
      int start = 0;
      int end = A.length - 1;
      int index = start;
      
      while(start <= end){
          int middle = (start + end)/2;
          if(A[middle] == target) return middle;
          
          if(target < A[middle]){
              end = middle - 1;
              index = middle;
          }else{
              start = middle + 1;
              index = start;
          }
      }
      
      return index;
    }

No comments:

Post a Comment