首页 > 其他 > 详细

leetcode 35. Search Insert Position

时间:2019-12-15 15:43:19      阅读:65      评论:0      收藏:0      [点我收藏+]

参考这里https://leetcode.wang/leetCode-35-Search-Insert-Position.html, 需要想到最简单的处理情况,如果数组只剩下 2 5,target 是 1, 3, 6 的时候,此时我们应该返回什么就行。

var searchInsert = function(nums, target) {
     var left = 0, right = nums.length - 1;
      while (left <= right) {
        var mid = left + ((right - left) >> 1);
        if (nums[mid] == target) { 
          return mid

        } if (nums[mid] < target) {//[1,2,3,4,5,6,7], mid = 4, target = 5
          left = mid + 1//left只能往mid靠
        } else {
          right = mid - 1//right只能往mid靠
        }
      }
      return left
};

或者

var searchInsert = function(nums, target) {
     var left = 0, right = nums.length - 1;
      while (left <= right) {
        var mid = left + ((right - left) >> 1);
        if (nums[mid] == target) { 
          return mid

        } else if (nums[mid] > target) {
          right = mid - 1
        } else {
          left = mid + 1
        }
      }
      return left
};

leetcode 35. Search Insert Position

原文:https://www.cnblogs.com/rubylouvre/p/12044156.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!