Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ali322/leetcode
leetcode solutions
https://github.com/ali322/leetcode
Last synced: 10 days ago
JSON representation
leetcode solutions
- Host: GitHub
- URL: https://github.com/ali322/leetcode
- Owner: ali322
- Created: 2021-06-29T07:51:20.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2021-07-21T07:27:34.000Z (over 3 years ago)
- Last Synced: 2024-10-11T09:14:41.639Z (about 1 month ago)
- Language: JavaScript
- Size: 293 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Leetcode Solution
===[![Build Status][circleci-image]][circleci-url]
## Solution
| 序号 | 难度 | 题目 | 解答 |
| --- | --- | --- | --- |
| 1 | 简单 | [两数之和](https://leetcode-cn.com/problems/two-sum) | [1.two-sum](solution/1.two-sum.js) |
| 3 | 中等 | [无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters) | [3.longest-substring-without-repeating-characters](solution/3.longest-substring-without-repeating-characters.js) |
| 5 | 中等 | [无重复字符的最长子串](https://leetcode-cn.com/problems/longest-palindromic-substring) | [5.longest-palindromic-substring.js](solution/5.longest-palindromic-substring.js) |
| 10 | 困难 | [正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching) | [10.regular-expression-matching](solution/10.regular-expression-matching.js) |
| 15 | 中等 | [三数之和](https://leetcode-cn.com/problems/3sum) | [15.3sum](solution/15.3sum.js) |
| 18 | 中等 | [四数之和](https://leetcode-cn.com/problems/4sum) | [18.4sum](solution/18.4sum.js) |
| 20 | 中等 | [有效的括号](https://leetcode-cn.com/problems/valid-parentheses) | [20.valid-parentheses](solution/20.valid-parentheses.js) |
| 25 | 困难 | [K个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group) | [25.reverse-nodes-in-k-group](solution/25.reverse-nodes-in-k-group.js) |
| 26 | 简单 | [删除有序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array) | [26.remove-duplicates-from-sorted-array](solution/26.remove-duplicates-from-sorted-array.js) |
| 28 | 简单 | [实现strStr函数](https://leetcode-cn.com/problems/implement-strstr) | [28.implement-strstr](solution/28.implement-strstr.js) |
| 42 | 困难 | [接雨水](https://leetcode-cn.com/problems/trapping-rain-water) | [42.trapping-rain-water](solution/42.trapping-rain-water.js) |
| 43 | 中等 | [字符串相乘](https://leetcode-cn.com/problems/multiply-strings) | [43.multiply-strings](solution/43.multiply-strings.js) |
| 46 | 中等 | [全排列](https://leetcode-cn.com/problems/permutations) | [46.permutations](solution/46.permutations.js) |
| 51 | 困难 | [N皇后](https://leetcode-cn.com/problems/n-queens) | [51.n-queens](solution/51.n-queens.js) |
| 56 | 中等 | [合并区间](https://leetcode-cn.com/problems/merge-intervals) | [56.merge-intervals](solution/56.merge-intervals.js) |
| 72 | 困难 | [编辑距离](https://leetcode-cn.com/problems/edit-distance) | [72.edit-distance](solution/72.edit-distance.js) |
| 76 | 困难 | [最小覆盖子串](https://leetcode-cn.com/problems/minimum-window-substring) | [76.minimum-window-substring](solution/76.minimum-window-substring.js) |
| 77 | 中等 | [组合](https://leetcode-cn.com/problems/combinations) | [77.combinations](solution/77.combinations.js) |
| 78 | 中等 | [子集](https://leetcode-cn.com/problems/subsets) | [78.subsets](solution/78.subsets.js) |
| 92 | 中等 | [反转链表 II](https://leetcode-cn.com/problems/reverse-linked-list-ii) | [92.reverse-linked-list-ii](solution/92.reverse-linked-list-ii.js) |
| 98 | 中等 | [验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree) | [98.validate-binary-search-tree](solution/98.validate-binary-search-tree.js) |
| 83 | 简单 | [删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list) | [83.remove-duplicates-from-sorted-list](solution/83.remove-duplicates-from-sorted-list.js) |
| 100 | 简单 | [相同的树](https://leetcode-cn.com/problems/same-tree) | [100.same-tree](solution/100.same-tree.js) |
| 111 | 简单 | [二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree) | [111.minimum-depth-of-binary-tree](solution/111.minimum-depth-of-binary-tree.js) |
| 121 | 简单 | [买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock) | [121.best-time-to-buy-and-sell-stock](solution/121.best-time-to-buy-and-sell-stock.js) |
| 130 | 简单 | [被围绕的区域](https://leetcode-cn.com/problems/surrounded-regions) | [130.surrounded-regions](solution/130.surrounded-regions.js) |
| 141 | 简单 | [环形链表](https://leetcode-cn.com/problems/linked-list-cycle) | [141.linked-list-cycle](solution/141.linked-list-cycle-ii.js) |
| 142 | 中等 | [环形链表 II](https://leetcode-cn.com/problems/linked-list-cycle-ii) | [142.linked-list-cycle-ii](solution/142.linked-list-cycle.js) |
| 146 | 中等 | [LRU 缓存机制](https://leetcode-cn.com/problems/lru-cache) | [146.lru-cache](solution/146.lru-cache.js) |
| 188 | 困难 | [买卖股票的最佳时机 IV](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv) | [188.best-time-to-buy-and-sell-stock-iv](solution/188.best-time-to-buy-and-sell-stock-iv.js) |
| 198 | 中等 | [打家劫舍](https://leetcode-cn.com/problems/house-robber) | [198.house-robber](solution/198.house-robber.js) |
| 204 | 简单 | [计算素数](https://leetcode-cn.com/problems/count-primes) | [204.count-primes](solution/204.count-primes.js) |
| 206 | 简单 | [反转链表](https://leetcode-cn.com/problems/reverse-linked-list) | [206.reverse-linked-list](solution/206.reverse-linked-list.js) |
| 225 | 简单 | [用队列实现栈](https://leetcode-cn.com/problems/implement-stack-using-queues) | [225.implement-stack-using-queues](solution/225.implement-stack-using-queues.js) |
| 232 | 简单 | [用栈实现队列](https://leetcode-cn.com/problems/implement-queue-using-stacks) | [232.implement-queue-using-stacks](solution/232.implement-queue-using-stacks.js) |
| 234 | 简单 | [回文链表](https://leetcode-cn.com/problems/palindrome-linked-list) | [234.palindrome-linked-list](solution/234.palindrome-linked-list.js) |
| 239 | 困难 | [滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum) | [239.sliding-window-maximum](solution/239.sliding-window-maximum.js) |
| 292 | 简单 | [Nim游戏](https://leetcode-cn.com/problems/nim-game) | [292.nim-game](solution/292.nim-game.js) |
| 300 | 中等 | [最长递增子序列](https://leetcode-cn.com/problems/longest-increasing-subsequence) | [300.longest-increasing-subsequence](solution/300.longest-increasing-subsequence.js) |
| 319 | 中等 | [灯泡开关](https://leetcode-cn.com/problems/bulb-switcher) | [319.bulb-switcher](solution/319.bulb-switcher.js) |
| 322 | 中等 | [零钱兑换](https://leetcode-cn.com/problems/coin-change) | [322.coin-change](solution/322.coin-change.js) |
| 355 | 中等 | [设计推特](https://leetcode-cn.com/problems/design-twitter) | [355.design-twitter](solution/355.design-twitter.js) |
| 382 | 中等 | [链表随机节点](https://leetcode-cn.com/problems/linked-list-random-node) | [382.linked-list-random-node](solution/382.linked-list-random-node.js) |
| 384 | 中等 | [打乱数组](https://leetcode-cn.com/problems/shuffle-an-array) | [384.shuffle-an-array](solution/384.shuffle-an-array.js) |
| 386 | 中等 | [字典序排数](https://leetcode-cn.com/problems/lexicographical-numbers) | [386.lexicographical-numbers](solution/386.lexicographical-numbers.js) |
| 392 | 中等 | [判断子序列](https://leetcode-cn.com/problems/is-subsequence) | [392.is-subsequence](solution/392.is-subsequence.js) |
| 398 | 中等 | [随机数索引](https://leetcode-cn.com/problems/random-pick-index) | [398.random-pick-index.js](solution/398.random-pick-index.js) |
| 435 | 中等 | [无重叠区间](https://leetcode-cn.com/problems/non-overlapping-intervals) | [435.non-overlapping-intervals](solution/435.non-overlapping-intervals.js) |
| 437 | 中等 | [路径总和 III](https://leetcode-cn.com/problems/path-sum-iii) | [437.path-sum-iii](solution/437.path-sum-iii.js) |
| 448 | 简单 | [找到所有数组中缺失的数字](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array) | [448.find-all-numbers-disappeared-in-an-array](solution/448.find-all-numbers-disappeared-in-an-array.js) |
| 450 | 中等 | [删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst) | [450.delete-node-in-a-bst](solution/450.delete-node-in-a-bst.js) |
| 496 | 简单 | [下一个更大元素 I](https://leetcode-cn.com/problems/next-greater-element-i) | [496.next-greater-element-i](solution/496.next-greater-element-i.js) |
| 503 | 中等 | [下一个更大元素 II](https://leetcode-cn.com/problems/next-greater-element-ii) | [503.next-greater-element-ii](solution/503.next-greater-element-ii.js) |
| 516 | 中等 | [最长回文子序列](https://leetcode-cn.com/problems/longest-palindromic-subsequence) | [516.longest-palindromic-subsequence](solution/516.longest-palindromic-subsequence.js) |
| 560 | 中等 | [和为k的数组](https://leetcode-cn.com/problems/subarray-sum-equals-k) | [560.subarray-sum-equals-k](solution/560.subarray-sum-equals-k.js) |
| 567 | 中等 | [字符串排列](https://leetcode-cn.com/problems/permutation-in-string) | [567.permutation-in-string](solution/567.permutation-in-string.js) |
| 645 | 简单 | [错误的集合](https://leetcode-cn.com/problems/set-mismatch) | [645.set-mismatch](solution/645.set-mismatch.js) |
| 650 | 中等 | [只有两个键的键盘](https://leetcode-cn.com/problems/2-keys-keyboard) | [650.2-keys-keyboard](solution/650.2-keys-keyboard.js) |
| 700 | 简单 | [二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree) | [700.search-in-a-binary-search-tree](solution/700.search-in-a-binary-search-tree.js) |
| 701 | 中等 | [二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree) | [701.insert-into-a-binary-search-tree](solution/701.insert-into-a-binary-search-tree.js) |
| 704 | 简单 | [二分查找](https://leetcode-cn.com/problems/binary-search) | [704.binary-search](solution/704.binary-search.js) |
| 733 | 简单 | [图像渲染](https://leetcode-cn.com/problems/flood-fill) | [733.flood-fill](solution/733.flood-fill.js) |
| 739 | 中等 | [每日温度](https://leetcode-cn.com/problems/daily-temperatures) | [739.daily-temperatures](solution/739.daily-temperatures.js) |
| 752 | 中等 | [打开转盘锁](https://leetcode-cn.com/problems/open-the-lock) | [752.open-the-lock](solution/752.open-the-lock.js) |
| 855 | 中等 | [考场就坐](https://leetcode-cn.com/problems/exam-room) | [855.exam-room](solution/855.exam-room.js) |
| 875 | 中等 | [爱吃香蕉的珂珂](https://leetcode-cn.com/problems/koko-eating-bananas) | [875.koko-eating-bananas](solution/875.koko-eating-bananas.js) |
| 877 | 中等 | [石头游戏](https://leetcode-cn.com/problems/stone-game) | [887.super-egg-drop](solution/877.stone-game.js) |
| 887 | 困难 | [鸡蛋掉落](https://leetcode-cn.com/problems/super-egg-drop) | [887.super-egg-drop](solution/887.super-egg-drop.js) |
| 969 | 中等 | [煎饼排序](https://leetcode-cn.com/problems/pancake-sorting) | [969.pancake-sorting](solution/969.pancake-sorting.js) |
| 986 | 中等 | [区间列表的交集](https://leetcode-cn.com/problems/interval-list-intersections) | [986.interval-list-intersections](solution/986.interval-list-intersections.js) |
| 990 | 中等 | [等式方程的可满足性](https://leetcode-cn.com/problems/satisfiability-of-equality-equations) | [990.satisfiability-of-equality-equations](solution/990.satisfiability-of-equality-equations.js) |
| 1011 | 中等 | [在D天内运送包裹的能力](https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days) | [1011.capacity-to-ship-packages-within-d-days](solution/1011.capacity-to-ship-packages-within-d-days.js) |
| 1143 | 中等 | [最长公共子序列](https://leetcode-cn.com/problems/longest-common-subsequence) | [1143.longest-common-subsequence](solution/1143.longest-common-subsequence.js) |
| 1319 | 中等 | [连通网络的操作次数](https://leetcode-cn.com/problems/number-of-operations-to-make-network-connected) | [1319.number-of-operations-to-make-network-connected](solution/1319.number-of-operations-to-make-network-connected.js) |
| 1884 | 中等 | [鸡蛋掉落-两枚鸡蛋](https://leetcode-cn.com/problems/egg-drop-with-2-eggs-and-n-floors) | [1884.egg-drop-with-2-eggs-and-n-floors](solution/1884.egg-drop-with-2-eggs-and-n-floors.js) |## License
[MIT License](http://en.wikipedia.org/wiki/MIT_License)
[circleci-url]: https://circleci.com/gh/ali322/leetcode
[circleci-image]: https://img.shields.io/circleci/project/github/ali322/leetcode.svg?style=flat