const binarySearch = require('./binarySearch')

const arr = new Array(100).fill(0).map(() => Math.round(Math.random() * 100)).sort((a, b) => a - b)

console.log(arr)

const target = Math.round(Math.random() * 100)

console.log('target', target)

const result = binarySearch(arr, target)

console.log('result', arr[result])

function check (result) {

let index = -1

for (let i of arr) {

if (arr[i] === target) {

index = i

console.log(target, arr[i])

break

}

}

const flag = result === index

return flag

}

console.log(check(result) ? 'success' : 'fail')

- [ ] [1. 两数之和](https://github.com/Geekhyt/javascript-leetcode/issues/1)

- [ ] [剑指 Offer 03. 数组中重复的数字](https://github.com/Geekhyt/javascript-leetcode/issues/60)

- [ ] [11. 盛水最多的容器](https://github.com/Geekhyt/javascript-leetcode/issues/2)

- [ ] [15. 三数之和](https://github.com/Geekhyt/javascript-leetcode/issues/3)

- [ ] [26. 删除排序数组中的重复项](https://github.com/Geekhyt/javascript-leetcode/issues/4)

- [ ] [27. 移除元素](https://github.com/Geekhyt/javascript-leetcode/issues/67)

- [ ] [66. 加一 ](https://github.com/Geekhyt/javascript-leetcode/issues/5)

- [ ] [88. 合并两个有序数组](https://github.com/Geekhyt/javascript-leetcode/issues/72)

- [ ] [169. 多数元素](https://github.com/Geekhyt/javascript-leetcode/issues/68)

- [ ] [283. 移动零 ](https://github.com/Geekhyt/javascript-leetcode/issues/6)

- [ ] [349. 两个数组的交集](https://github.com/Geekhyt/javascript-leetcode/issues/69)

- [ ] [217. 存在重复元素](https://github.com/Geekhyt/javascript-leetcode/issues/88)

- [ ] [19. 删除链表的倒数第 N 个结点](https://github.com/Geekhyt/javascript-leetcode/issues/12)

- [ ] [21. 合并两个有序链表](https://github.com/Geekhyt/javascript-leetcode/issues/7)

- [ ] [24. 两两交换链表中的节点](https://github.com/Geekhyt/javascript-leetcode/issues/8)

- [ ] [141. 环形链表](https://github.com/Geekhyt/javascript-leetcode/issues/9)

- [ ] [206. 反转链表](https://github.com/Geekhyt/javascript-leetcode/issues/10)

- [ ] [876. 链表的中间结点](https://github.com/Geekhyt/javascript-leetcode/issues/11)

- [ ] [160. 相交链表](https://github.com/Geekhyt/javascript-leetcode/issues/61)

- [ ] [25. K 个一组翻转链表](https://github.com/Geekhyt/javascript-leetcode/issues/62)

- [ ] [83. 删除排序链表中的重复元素](https://github.com/Geekhyt/javascript-leetcode/issues/63)

- [ ] [剑指 Offer 06. 从尾到头打印链表](https://github.com/Geekhyt/javascript-leetcode/issues/65)

- [ ] [面试题 02.02. 返回倒数第 k 个节点](https://github.com/Geekhyt/javascript-leetcode/issues/66)

- [ ] [94. 二叉树的中序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/13)

- [ ] [98. 验证二叉搜索树](https://github.com/Geekhyt/javascript-leetcode/issues/75)

- [ ] [100. 相同的树](https://github.com/Geekhyt/javascript-leetcode/issues/16)

- [ ] [101. 对称二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/17)

- [ ] [102. 二叉树的层序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/18)

- [ ] [104. 二叉树的最大深度](https://github.com/Geekhyt/javascript-leetcode/issues/19)

- [ ] [110. 平衡二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/76)

- [ ] [108. 将有序数组转换为二叉搜索树](https://github.com/Geekhyt/javascript-leetcode/issues/79)

- [ ] [112. 路径总和](https://github.com/Geekhyt/javascript-leetcode/issues/77)

- [ ] [144. 二叉树的前序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/14)

- [ ] [145. 二叉树的后序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/15)

- [ ] [226. 翻转二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/20)

- [ ] [543. 二叉树的直径](https://github.com/Geekhyt/javascript-leetcode/issues/78)

- [ ] [617. 合并二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/87)

- [ ] [429. N 叉树的层序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/89)

- [ ] [590. N 叉树的后序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/90)

- [ ] [589. N 叉树的前序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/91)

- [ ] [111. 二叉树的最小深度](https://github.com/Geekhyt/javascript-leetcode/issues/92)

- [ ] [236. 二叉树的最近公共祖先](https://github.com/Geekhyt/javascript-leetcode/issues/93)

- [ ] [297. 二叉树的序列化与反序列化](https://github.com/Geekhyt/javascript-leetcode/issues/94)

- [ ] [20. 有效的括号](https://github.com/Geekhyt/javascript-leetcode/issues/21)

- [ ] [84. 柱状图中最大的矩形](https://github.com/Geekhyt/javascript-leetcode/issues/22)

- [ ] [155. 最小栈](https://github.com/Geekhyt/javascript-leetcode/issues/23)

- [ ] [739. 每日温度](https://github.com/Geekhyt/javascript-leetcode/issues/74)

- [ ] [1047. 删除字符串中的所有相邻重复项](https://github.com/Geekhyt/javascript-leetcode/issues/80)

- [ ] [239. 滑动窗口最大值](https://github.com/Geekhyt/javascript-leetcode/issues/95)

- [ ] [55. 跳跃游戏](https://github.com/Geekhyt/javascript-leetcode/issues/24)

- [ ] [455. 分发饼干](https://github.com/Geekhyt/javascript-leetcode/issues/25)

- [ ] [860. 柠檬水找零](https://github.com/Geekhyt/javascript-leetcode/issues/26)

- [ ] [17. 电话号码的字母组合](https://github.com/Geekhyt/javascript-leetcode/issues/27)

- [ ] [46. 全排列](https://github.com/Geekhyt/javascript-leetcode/issues/28)

- [ ] [47. 全排列 II](https://github.com/Geekhyt/javascript-leetcode/issues/32)

- [ ] [22. 括号生成](https://github.com/Geekhyt/javascript-leetcode/issues/29)

- [ ] [39. 组合总和](https://github.com/Geekhyt/javascript-leetcode/issues/30)

- [ ] [40. 组合总和 II](https://github.com/Geekhyt/javascript-leetcode/issues/31)

- [ ] [77. 组合](https://github.com/Geekhyt/javascript-leetcode/issues/33)

- [ ] [78. 子集](https://github.com/Geekhyt/javascript-leetcode/issues/34)

- [ ] [125. 验证回文串](https://github.com/Geekhyt/javascript-leetcode/issues/35)

- [ ] [344. 反转字符串](https://github.com/Geekhyt/javascript-leetcode/issues/36)

- [ ] [415. 字符串相加](https://github.com/Geekhyt/javascript-leetcode/issues/37)

- [ ] [58. 最后一个单词的长度](https://github.com/Geekhyt/javascript-leetcode/issues/74)

- [ ] [409. 最长回文串](https://github.com/Geekhyt/javascript-leetcode/issues/81)

- [ ] [冒泡排序](https://github.com/Geekhyt/javascript-leetcode/issues/39)

- [ ] [插入排序](https://github.com/Geekhyt/javascript-leetcode/issues/40)

- [ ] [选择排序](https://github.com/Geekhyt/javascript-leetcode/issues/41)

- [ ] [归并排序](https://github.com/Geekhyt/javascript-leetcode/issues/42)

- [ ] [快速排序](https://github.com/Geekhyt/javascript-leetcode/issues/43)

- [ ] [堆排序](https://github.com/Geekhyt/javascript-leetcode/issues/44)

- [ ] [剑指 Offer 40. 最小的k个数](https://github.com/Geekhyt/javascript-leetcode/issues/82)

- [ ] [200. 岛屿数量](https://github.com/Geekhyt/javascript-leetcode/issues/64)

- [ ] [146. LRU 缓存机制](https://github.com/Geekhyt/javascript-leetcode/issues/86)

- [ ] [136. 只出现一次的数字](https://github.com/Geekhyt/javascript-leetcode/issues/83)

- [ ] [52. N皇后 II](https://github.com/Geekhyt/javascript-leetcode/issues/84)

- [ ] [704. 二分查找](https://github.com/Geekhyt/javascript-leetcode/issues/85)

- [ ] [33. 搜索旋转排序数组](https://github.com/Geekhyt/javascript-leetcode/issues/70)

- [ ] [35. 搜索插入位置](https://github.com/Geekhyt/javascript-leetcode/issues/71)

- [ ] [70. 爬楼梯](https://github.com/Geekhyt/javascript-leetcode/issues/38)

- [ ] [一口气团灭 6 道股票算法](https://github.com/Geekhyt/javascript-leetcode/issues/45)

- [ ] 121.买卖股票的最佳时机

- [ ] 122.买卖股票的最佳时机 II

- [ ] 123.买卖股票的最佳时机 III

- [ ] 188.买卖股票的最佳时机 IV

- [ ] 309.最佳买卖股票时机含冷冻期

- [ ] 714.买卖股票的最佳时机含手续费

- [ ] [198. 打家劫舍](https://github.com/Geekhyt/javascript-leetcode/issues/46)

- [ ] [5. 最长回文子串](https://github.com/Geekhyt/javascript-leetcode/issues/47)

- [ ] [53. 最大子序和](https://github.com/Geekhyt/javascript-leetcode/issues/48)

- [ ] [300. 最长递增子序列](https://github.com/Geekhyt/javascript-leetcode/issues/49)

- [ ] [32. 最长有效括号](https://github.com/Geekhyt/javascript-leetcode/issues/50)

- [ ] [64. 最小路径和](https://github.com/Geekhyt/javascript-leetcode/issues/51)

- [ ] [62. 不同路径](https://github.com/Geekhyt/javascript-leetcode/issues/52)

- [ ] [221. 最大正方形](https://github.com/Geekhyt/javascript-leetcode/issues/53)

- [ ] [72. 编辑距离](https://github.com/Geekhyt/javascript-leetcode/issues/54)

- [ ] [322. 零钱兑换](https://github.com/Geekhyt/javascript-leetcode/issues/55)

- [ ] [剑指 Offer 42. 连续子数组的最大和](https://github.com/Geekhyt/javascript-leetcode/issues/56)

- [ ] [139. 单词拆分](https://github.com/Geekhyt/javascript-leetcode/issues/57)

- [ ] [887. 鸡蛋掉落](https://github.com/Geekhyt/javascript-leetcode/issues/58)

- [ ] [279. 完全平方数](https://github.com/Geekhyt/javascript-leetcode/issues/59)