6.[Easy] Search Insert Position
来源:互联网 发布:linux 输入法 编辑:程序博客网 时间:2024/06/03 21:33
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
我们使用二分查找来解决
// Given a sorted array and a target value,// 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./* linear search */function findPosition1 (value, arr) { for(var i=0; i<arr.length; ++i) { if(arr[i] > value) { return i; } } return i;}function test() { // 0 1 2 3 var arr = [1, 3, 5, 6]; console.log(findPosition1(10, arr));}test();/* 二分查找 */function binarySearch(value, arr) { var len = arr.length, mid = Math.floor(len / 2); if(value == arr[mid]) { return mid; } else if(value > arr[mid]) { return binarySearchAux(mid+1, len); } else { return binarySearchAux(0, mid); } // binary search auxiliary function binarySearchAux(start, stop) { /* @start: the start of arr (included) @stop: the stop of arr(not incluedd) */ if(start == stop) { return start; } var mid = (start + stop) / 2; if(value == arr[mid]) { return mid; } else if(value > arr[mid]) { return binarySearchAux(mid+1, stop); } else { return binarySearchAux(start, mid); } }}function anotherTest() { // 0 1 2 3 4 var arr = [1, 2, 8, 9, 10]; console.log(binarySearch(-10, arr));}anotherTest();
另外提供一个更加简洁的非递归版本
/* Here I will offer you a non-recursive version */function binarySearch1(value, arr) { var len = arr.length, low = 0, high = len, mid = Math.floor((low + high) / 2); while(low < high) { if(arr[mid] == value) { return mid; } else if (arr[mid] < value) { low = mid + 1; } else { high = mid; } mid = Math.floor((low + high) / 2); } return low;}function otherTest() { var arr = [10, 20, 30, 40, 50]; console.log(binarySearch1(500, arr));}otherTest();
阅读全文
1 0
- 6.[Easy] Search Insert Position
- Easy 10 Search Insert Position(35)
- LeetCode-Easy刷题(10) Search Insert Position
- LeetCode: Search Insert Position
- Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode34:Search Insert Position
- Search Insert Position
- [35]Search Insert Position
- Search Insert Position
- Search Insert Position
- [LeetCode]Search Insert Position
- Search Insert Position
- VTK初级学习
- ROS 卡尔曼滤波
- g_signal_connect
- netty源码学习二(EventLoopGroup、EventLoop)
- U-net使用, 图像分割(边缘检测)
- 6.[Easy] Search Insert Position
- es 建索引时指定分片数据和副本数
- CAMWorks.For.Solid.Edge.2017.SP2.Win64 1DVD
- dubbo做服务治理,搭建服务提供者provider和消费者consumer
- jdbcTemplate执行插入语句带回主键值
- 关于setThrowingEnabled接口
- 【复习记录】树上倍增
- HTML+CSS+JS实现缓冲动画
- Android 接口回调实例