KO
|
EN
gitlite — search
Search
#python
#javascript
#react
#twitter
#go
#http
#unity
#api
#pytorch
#cpp
#ctf
#php
LeetCode
★ 64
Open GitHub ↗
LeetCode 经典题目（JavaScript 实现）
Download README (.md)
Explore Similar Repositories
leetcode-js
:
LeetCode problems with JS
leetcode
:
Mastering leetcode using simple javaScript.
Leetcode-JS-Solutions
:
:tropical_drink: Leetcode solutions using JavaScript.
leetcode
:
leetcode刷题 算法练习 JavaScript实现
life-is-moment
:
📕个人博客, 喜欢react的可以关注一下 ~
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
LeetCode
?
Download (.md)
## LeetCode 经典题目（JavaScript 实现） ### 链表 (Linked List) - [19. Remove Nth Node From End of List](<LeetCode/Linked List/19. Remove Nth Node From End of List.js.md>) - [21. Merge Two Sorted Lists](<LeetCode/Linked List/21. Merge Two Sorted Lists.js.md>) - [23. Merge k Sorted Lists](<LeetCode/Linked List/23. Merge k Sorted Lists.js.md>) - [25. Reverse Nodes in k-Group](<LeetCode/Linked List/25. Reverse Nodes in k-Group.js.md>) - [92. Reverse Linked List II](<LeetCode/Linked List/92. Reverse Linked List II.js.md>) - [141. Linked List Cycle](<LeetCode/Linked List/141. Linked List Cycle.js.md>) - [142. Linked List Cycle II](<LeetCode/Linked List/142. Linked List Cycle II.js.md>) - [143. Reorder List](<LeetCode/Linked List/143. Reorder List.js.md>) - [148. Sort List](<LeetCode/Linked List/148. Sort List.js.md>) - [160. Intersection of Two Linked Lists](<LeetCode/Linked List/160. Intersection of Two Linked Lists.js.md>) - [203. Remove Linked List Elements](<LeetCode/Linked List/203. Remove Linked List Elements.js.md>) - [206. Reverse Linked List](<LeetCode/Linked List/206. Reverse Linked List.js.md>) ### 栈与队列（Stack and Queue） - [20. Valid Parentheses](<LeetCode/Stack and Queue/20. Valid Parentheses.js.md>) - [32. Longest Valid Parentheses](<LeetCode/Stack and Queue/32. Longest Valid Parentheses.js.md>) - [84. Largest Rectangle in Histogram](<LeetCode/Stack and Queue/84. Largest Rectangle in Histogram.js.md>) - [225. Implement Stack using Queues](<LeetCode/Stack and Queue/225. Implement Stack using Queues.js.md>) - [232. Implement Queue using Stacks](<LeetCode/Stack and Queue/232. Implement Queue using Stacks.js.md>) - [239. Sliding Window Maximum](<LeetCode/Stack and Queue/239. Sliding Window Maximum.js.md>) - [581. Shortest Unsorted Continuous Subarray](<LeetCode/Stack and Queue/581. Shortest Unsorted Continuous Subarray.js.md>) - [739. Daily Temperatures](<LeetCode/Stack and Queue/739. Daily Temperatures.js.md>) ### 哈希表 (Hash Table) - [1. Two Sum](<LeetCode/Hash Table/1. Two Sum.js.md>) - [15. 3Sum](<LeetCode/Hash Table/15. 3Sum.js.md>) - [169. Majority Element](<LeetCode/Hash Table/169. Majority Element.js.md>) ### 数组（Array） - [31. Next Permutation](<LeetCode/Array/31. Next Permutation.js.md>) - [41. First Missing Positive](<LeetCode/Array/41. First Missing Positive.js.md>) - [54. Spiral Matrix](<LeetCode/Array/54. Spiral Matrix.js.md>) - [189. Rotate Array](<LeetCode/Array/189. Rotate Array.js.md>) ### 字符串（String） - [686. Repeated String Match](<LeetCode/String/686. Repeated String Match.js.md>) - [1044. Longest Duplicate Substring](<LeetCode/String/1044. Longest Duplicate Substring.js.md>) ### 二分查找（Binary Search） - [4. Median of Two Sorted Arrays](<LeetCode/Binary Search/4. Median of Two Sorted Arrays.js.md>) - [33. Search in Rotated Sorted Array](<LeetCode/Binary Search/33. Search in Rotated Sorted Array.js.md>) - [34. Find First and Last Position of Element in Sorted Array](<LeetCode/Binary Search/34. Find First and Last Position of Element in Sorted Array.js.md>) - [35. Search Insert Position](<LeetCode/Binary Search/35. Search Insert Position.js.md>) - [81. Search in Rotated Sorted Array II](<LeetCode/Binary Search/81. Search in Rotated Sorted Array II.js.md>) - [153. Find Minimum in Rotated Sorted Array](<LeetCode/Binary Search/153. Find Minimum in Rotated Sorted Array.js.md>) - [154. Find Minimum in Rotated Sorted Array II](<LeetCode/Binary Search/154. Find Minimum in Rotated Sorted Array II.js.md>) - [378. Kth Smallest Element in a Sorted Matrix](<LeetCode/Binary Search/378. Kth Smallest Element in a Sorted Matrix.js.md>) - [658. Find K Closest Elements](<LeetCode/Binary Search/658. Find K Closest Elements.js.md>) - [704. Binary Search](<LeetCode/Binary Search/704. Binary Search.js.md>) - [875. Koko Eating Bananas](<LeetCode/Binary Search/875. Koko Eating Bananas.js.md>) ### 排序（Sorting） - [215. Kth Largest Element in an Array](<LeetCode/Sorting/215. Kth Largest Element in an Array.js.md>) - [315. Count of Smaller Numbers After Self](<LeetCode/Sorting/315. Count of Smaller Numbers After Self.js.md>) - [912. Sort an Array](<LeetCode/Sorting/912. Sort an Array.js.md>) ### 双指针（Two Pointers） - [11. Container With Most Water](<LeetCode/Two Pointers/11. Container With Most Water.js.md>) - [42. Trapping Rain Water](<LeetCode/Two Pointers/42. Trapping Rain Water.js.md>) - [75. Sort Colors](<LeetCode/Two Pointers/75. Sort Colors.js.md>) - [283. Move Zeroes](<LeetCode/Two Pointers/283. Move Zeroes.js.md>) ### 滑动窗口（Sliding Window） - [3. Longest Substring Without Repeating Characters](<LeetCode/Sliding Window/3. Longest Substring Without Repeating Characters.js.md>) - [76. Minimum Window Substring](<LeetCode/Sliding Window/76. Minimum Window Substring.js.md>) - [209. Minimum Size Subarray Sum](<LeetCode/Sliding Window/209. Minimum Size Subarray Sum.js.md>) - [438. Find All Anagrams in a String](<LeetCode/Sliding Window/438. Find All Anagrams in a String.js.md>) - [713. Subarray Product Less Than K](<LeetCode/Sliding Window/713. Subarray Product Less Than K.js.md>) ### 二叉树（Binary Tree） - [94. Binary Tree Inorder Traversal](<LeetCode/Binary Tree/94. Binary Tree Inorder Traversal.js.md>) - [98. Validate Binary Search Tree](<LeetCode/Binary Tree/98. Validate Binary Search Tree.js.md>) - [101. Symmetric Tree](<LeetCode/Binary Tree/101. Symmetric Tree.js.md>) - [102. Binary Tree Level Order Traversal](<LeetCode/Binary Tree/102. Binary Tree Level Order Traversal.js.md>) - [104. Maximum Depth of Binary Tree](<LeetCode/Binary Tree/104. Maximum Depth of Binary Tree.js.md>) - [105. Construct Binary Tree from Preorder and Inorder Traversal](<LeetCode/Binary Tree/105. Construct Binary Tree from Preorder and Inorder Traversal.js.md>) - [106. Construct Binary Tree from Inorder and Postorder Traversal](<LeetCode/Binary Tree/106. Construct Binary Tree from Inorder and Postorder Traversal.js.md>) - [110. Balanced Binary Tree](<LeetCode/Binary Tree/110. Balanced Binary Tree.js.md>) - [112. Path Sum](<LeetCode/Binary Tree/112. Path Sum.js.md>) - [124. Binary Tree Maximum Path Sum](<LeetCode/Binary Tree/124. Binary Tree Maximum Path Sum.js.md>) - [144. Binary Tree Preorder Traversal](<LeetCode/Binary Tree/144. Binary Tree Preorder Traversal.js.md>) - [145. Binary Tree Postorder Traversal](<LeetCode/Binary Tree/145. Binary Tree Postorder Traversal.js.md>) - [173. Binary Search Tree Iterator](<LeetCode/Binary Tree/173. Binary Search Tree Iterator.js.md>) - [199. Binary Tree Right Side View](<LeetCode/Binary Tree/199. Binary Tree Right Side View.js.md>) - [222. Count Complete Tree Nodes](<LeetCode/Binary Tree/222. Count Complete Tree Nodes.js.md>) - [226. Invert Binary Tree](<LeetCode/Binary Tree/226. Invert Binary Tree.js.md>) - [236. Lowest Common Ancestor of a Binary Tree](<LeetCode/Binary Tree/236. Lowest Common Ancestor of a Binary Tree.js.md>) - [297. Serialize and Deserialize Binary Tree](<LeetCode/Binary Tree/297. Serialize and Deserialize Binary Tree.js.md>) - [450. Delete Node in a BST](<LeetCode/Binary Tree/450. Delete Node in a BST.js.md>) - [543. Diameter of Binary Tree](<LeetCode/Binary Tree/543. Diameter of Binary Tree.js.md>) ### 回溯（Backtracking） - [22. Generate Parentheses](<LeetCode/Backtracking/22. Generate Parentheses.js.md>) - [37. Sudoku Solver](<LeetCode/Backtracking/37. Sudoku Solver.js.md>) - [39. Combination Sum](<LeetCode/Backtracking/39. Combination Sum.js.md>) - [40. Combination Sum II](<LeetCode/Backtracking/40. Combination Sum II.js.md>) - [46. Permutations](<LeetCode/Backtracking/46. Permutations.js.md>) - [47. Permutations II](<LeetCode/Backtracking/47. Permutations II.js.md>) - [51. N-Queens](<LeetCode/Backtracking/51. N-Queens.js.md>) - [78. Subsets](<LeetCode/Backtracking/78. Subsets.js.md>) - [79. Word Search](<LeetCode/Backtracking/79. Word Search.js.md>) - [90. Subsets II](<LeetCode/Backtracking/90. Subsets II.js.md>) - [131. Palindrome Partitioning](<LeetCode/Backtracking/131. Palindrome Partitioning.js.md>) ### 贪心（Greedy） - [45. Jump Game II](<LeetCode/Greedy/45. Jump Game II.js.md>) - [55. Jump Game](<LeetCode/Greedy/55. Jump Game.js.md>) - [56. Merge Intervals](<LeetCode/Greedy/56. Merge Intervals.js.md>) - [135. Candy](<LeetCode/Greedy/135. Candy.js.md>) - [376. Wiggle Subsequence](<LeetCode/Greedy/376. Wiggle Subsequence.js.md>) - [402. Remove K Digits](<LeetCode/Greedy/402. Remove K Digits.js.md>) - [630. Course Schedule III](<LeetCode/Greedy/630. Course Schedule III.js.md>) - [763. Partition Labels](<LeetCode/Greedy/763. Partition Labels.js.md>) ### 动态规划（Dynamic Programming） - [5. Longest Palindromic Substring](<LeetCode/Dynamic Programming/5. Longest Palindromic Substring.js.md>) - [10. Regular Expression Matching](<LeetCode/Dynamic Programming/10. Regular Expression Matching.js.md>) - [44. Wildcard Matching](<LeetCode/Dynamic Programming/44. Wildcard Matching.js.md>) - [53. Maximum Subarray](<LeetCode/Dynamic Programming/53. Maximum Subarray.js.md>) - [64. Minimum Path Sum](<LeetCode/Dynamic Programming/64. Minimum Path Sum.js.md>) - [70. Climbing Stairs](<LeetCode/Dynamic Programming/70. Climbing Stairs.js.md>) - [72. Edit Distance](<LeetCode/Dynamic Programming/72. Edit Distance.js.md>) - [96. Unique Binary Search Trees](<LeetCode/Dynamic Programming/96. Unique Binary Search Trees.js.md>) - [97. Interleaving String](<LeetCode/Dynamic Programming/97. Interleaving String.js.md>) - [115. Distinct Subsequences](<LeetCode/Dynamic Programming/115. Distinct Subsequences.js.md>) - [121. Best Time to Buy and Sell Stock](<LeetCode/Dynamic Programming/121. Best Time to Buy and Sell Stock.js.md>) - [122. Best Time to Buy and Sell Stock II](<LeetCode/Dynamic Programming/122. Best Time to Buy and Sell Stock II.js.md>) - [123. Best Time to Buy and Sell Stock III](<LeetCode/Dynamic Programming/123. Best Time to Buy and Sell Stock III.js.md>) - [139. Word Break](<LeetCode/Dynamic Programming/139. Word Break.js.md>) - [152. Maximum Product Subarray](<LeetCode/Dynamic Programming/152. Maximum Product Subarray.js.md>) - [188. Best Time to Buy and Sell Stock IV](<LeetCode/Dynamic Programming/188. Best Time to Buy and Sell Stock IV.js.md>) - [198. House Robber](<LeetCode/Dynamic Programming/198. House Robber.js.md>) - [213. House Robber II](<LeetCode/Dynamic Programming/213. House Robber II.js.md>) - [221. Maximal Square](<LeetCode/Dynamic Programming/221. Maximal Square.js.md>) - [279. Perfect Squares](<LeetCode/Dynamic Programming/279. Perfect Squares.js.md>) - [300. Longest Increasing Subsequence](<LeetCode/Dynamic Programming/300. Longest Increasing Subsequence.js.md>) - [309. Best Time to Buy and Sell Stock with Cooldown](<LeetCode/Dynamic Programming/309. Best Time to Buy and Sell Stock with Cooldown.js.md>) - [312. Burst Balloons](<LeetCode/Dynamic Programming/312. Burst Balloons.js.md>) - [322. Coin Change](<LeetCode/Dynamic Programming/322. Coin Change.js.md>) - [329. Longest Increasing Path in a Matrix](<LeetCode/Dynamic Programming/329. Longest Increasing Path in a Matrix.js.md>) - [337. House Robber III](<LeetCode/Dynamic Programming/337. House Robber III.js.md>) - [416. Partition Equal Subset Sum](<LeetCode/Dynamic Programming/416. Partition Equal Subset Sum.js.md>) - [494. Target Sum](<LeetCode/Dynamic Programming/494. Target Sum.js.md>) - [516. Longest Palindromic Subsequence](<LeetCode/Dynamic Programming/516. Longest Palindromic Subsequence.js.md>) - [518. Coin Change 2](<LeetCode/Dynamic Programming/518. Coin Change 2.js.md>) - [714. Best Time to Buy and Sell Stock with Transaction Fee](<LeetCode/Dynamic Programming/714. Best Time to Buy and Sell Stock with Transaction Fee.js.md>) - [718. Maximum Length of Repeated Subarray](<LeetCode/Dynamic Programming/718. Maximum Length of Repeated Subarray.js.md>) - [879. Profitable Schemes](<LeetCode/Dynamic Programming/879. Profitable Schemes.js.md>) - [887. Super Egg Drop](<LeetCode/Dynamic Programming/887. Super Egg Drop.js.md>) - [913. Cat and Mouse](<LeetCode/Dynamic Programming/913. Cat and Mouse.js.md>) - [918. Maximum Sum Circular Subarray](<LeetCode/Dynamic Programming/918. Maximum Sum Circular Subarray.js.md>) - [968. Binary Tree Cameras](<LeetCode/Dynamic Programming/968. Binary Tree Cameras.js.md>) - [1049. Last Stone Weight II](<LeetCode/Dynamic Programming/1049. Last Stone Weight II.js.md>) - [1143. Longest Common Subsequence](<LeetCode/Dynamic Programming/1143. Longest Common Subsequence.js.md>) ### 并查集（Union Find） - [547. Number of Provinces](<LeetCode/Union Find/547. Number of Provinces.js.md>) ### 字典树（Trie） - [208. Implement Trie (Prefix Tree)](<LeetCode/Trie/208. Implement Trie (Prefix Tree).js.md>) - [211. Design Add and Search Words Data Structure](<LeetCode/Trie/211. Design Add and Search Words Data Structure.js.md>) - [440. K-th Smallest in Lexicographical Order](<LeetCode/Trie/440. K-th Smallest in Lexicographical Order.js.md>) - [677. Map Sum Pairs](<LeetCode/Trie/677. Map Sum Pairs.js.md>) ### 线段树（Segment Tree） - [307. Range Sum Query - Mutable](<LeetCode/Segment Tree/307. Range Sum Query - Mutable.js.md>) ### 图（Graph） - [785. Is Graph Bipartite?](<LeetCode/Graph/785. Is Graph Bipartite?.js.md>) - [997. Find the Town Judge](<LeetCode/Graph/997. Find the Town Judge.js.md>) ### 深度优先搜索（Depth-First Search） - [200. Number of Islands](<LeetCode/Depth-First Search/200. Number of Islands.js.md>) ### 广度优先搜索（Breadth-First Search） - [407. Trapping Rain Water II](<LeetCode/Breadth-First Search/407. Trapping Rain Water II.js.md>) - [542. 01 Matrix](<LeetCode/Breadth-First Search/542. 01 Matrix.js.md>) - [847. Shortest Path Visiting All Nodes](<LeetCode/Breadth-First Search/847. Shortest Path Visiting All Nodes.js.md>) - [994. Rotting Oranges](<LeetCode/Breadth-First Search/994. Rotting Oranges.js.md>) ### 拓扑排序（Topological Sort） - [207. Course Schedule](<LeetCode/Topological Sort/207. Course Schedule.js.md>) - [210. Course Schedule II](<LeetCode/Topological Sort/210. Course Schedule II.js.md>) ### 前缀和（Prefix Sum） - [437. Path Sum III](<LeetCode/Prefix Sum/437. Path Sum III.js.md>) - [560. Subarray Sum Equals K](<LeetCode/Prefix Sum/560. Subarray Sum Equals K.js.md>) ### 设计（Design） - [146. LRU Cache](<LeetCode/Design/146. LRU Cache.js.md>) - [155. Min Stack](<LeetCode/Design/155. Min Stack.js.md>) - [380. Insert Delete GetRandom O(1)](<LeetCode/Design/380. Insert Delete GetRandom O(1).js.md>) - [460. LFU Cache](<LeetCode/Design/460. LFU Cache.js.md>)
