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

分析

即std::lower_bound()。

代码

  1. // Search Insert Position
  2. // 重新实现 lower_bound
  3. // 时间复杂度O(logn)，空间复杂度O(1)
  4. public class Solution {
  5.     public int searchInsert(int[] nums, int target) {
  6.         return lower_bound(nums, 0, nums.length, target);
  7.     }
  9.     int lower_bound (int[] A, int first, int last, int target) {
  10.         while (first != last) {
  11.             int mid = first + (last - first) / 2;
  12.             if (target > A[mid]) first = ++mid;
  13.             else                 last = mid;
  14.         }
  16.         return first;
  17.     }
  18. }

相关题目

原文: https://soulmachine.gitbooks.io/algorithm-essentials/content/java/search/search-insert-position.html