zoukankan      html  css  js  c++  java
  • 35. 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

    本题虽然是easy题目,但是通过similar problems把细节找出来,一是什么时候left<right,left<=right;而是循环内部判定条件,代码如下:

     1 public class Solution {
     2     public int searchInsert(int[] nums, int target) {
     3         int left = 0;
     4         int right = nums.length-1;
     5         while(left<=right){
     6             int mid = left+(right-left)/2;
     7             if(nums[mid]==target) return mid;
     8             else if(nums[mid]>target) right = mid-1;
     9             else left = mid+1;
    10         }
    11         return left;
    12     }
    13 }
  • 相关阅读:
    java 编码问题
    关于时间
    页面
    关于微信
    01-jQuery的介绍
    15-BOM
    14-定时器
    13-JS中的面向对象
    12-关于DOM操作的相关案例
    购物车练习
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6478209.html
Copyright © 2011-2022 走看看