Table of Contents generated with DocToc

• Algorithms
  • 预储备
  • Menu
  • LeetCode - JavaScript Solution
  • LeetCode - Swift4 Solution
  • Run demo

Algorithms

Algorithms notes & code & leetcode solution by Node.js.

预储备

基本数据结构：

• 堆/栈
• 链表
• 映射
• 散列
• 二叉树
• 图

Menu

• 并查集
• 基本排序
• 归并排序
• 快速排序
• 优先队列
• 二叉搜索树
• 平衡二叉搜索树
  • AVL 二叉搜索树
  • 2-3 二叉搜索树
  • 红黑二叉搜索树
  • 区间二叉搜索树
• k-d 树
• 字典树
  • Trie树（Prefix Tree）介绍
  • 数据结构之Trie树

LeetCode - JavaScript Solution

• No.01 Easy Two Sum
• No.02 Medium Add Two Numbers
• No.03 Medium Longest Substring Without Repeating Characters
• No.04 Hard Median of Two Sorted Arrays
• No.05 Medium Longest Palindromic Substring
• No.06 Medium ZigZag Conversion
• No.07 Easy Reverse Integer
• No.08 Medium String to Integer (atoi)
• No.09 Easy Palindrome Number
• No.10 Hard Regular Expression Matching
• No.11 Medium Container With Most Water
• No.12 Medium Integer to Roman
• No.13 Easy Roman to Integer
• No.14 Easy Longest Common Prefix
• No.15 Medium 3Sum
• No.16 Medium 3Sum Closest
• No.17 Medium Letter Combinations of a Phone Number
• No.18 Medium 4Sum
• No.19 Medium Remove Nth Node From End of List
• No.20 Easy Valid Parentheses
• No.21 Easy Merge Two Sorted Lists
• No.22 Medium Generate Parentheses
• No.23 Hard Merge k Sorted Lists
• No.24 Medium Swap Nodes in Pairs
• No.25 Hard Reverse Nodes in k-Group
• No.26 Easy Remove Duplicates from Sorted Array
• No.27 Easy Remove Element
• No.28 Easy Implement strStr()
• No.29 Medium Divide Two Integers
• No.30 Hard Substring with Concatenation of All Words
• No.31 Medium Next Permutation
• No.32 Hard Longest Valid Parentheses
• No.33 Medium Search in Rotated Sorted Array
• No.34 Medium Search for a Range
• No.35 Easy Search Insert Position
• No.36 Medium Valid Sudoku
• No.37 Hard Sudoku Solver
• No.38 Easy Count and Say
• No.39 Medium Combination Sum
• No.40 Medium Combination Sum II
• No.41 Hard First Missing Positive
• No.42 Hard Trapping Rain Water
• No.43 Medium Multiply Strings
• No.45 Hard Jump Game II
• No.46 Medium Permutations
• No.47 Medium Permutations II
• No.48 Medium Rotate Image
• No.49 Medium Group Anagrams
• No.50 Medium Pow(x, n)
• No.51 Hard N-Queens
• No.52 Hard N-Queens II
• No.53 Easy Maximum Subarray
• No.54 Medium Spiral Matrix
• No.55 Medium Jump Game
• No.56 Medium Merge Intervals
• No.57 Hard Insert Interval
• No.58 Easy Length of Last Word
• No.59 Medium Spiral Matrix II
• No.60 Medium Permutation Sequence
• No.61 Medium Rotate List
• No.62 Medium Unique Paths
• No.63 Medium Unique Paths II
• No.64 Medium Minimum Path Sum
• No.66 Easy Plus One
• No.67 Easy Add Binary
• No.69 Easy Sqrt(x)
• No.70 Easy Climbing Stairs
• No.71 Medium Simplify Path
• No.73 Medium Set Matrix Zeroes
• No.74 Medium Search a 2D Matrix
• No.75 Medium Sort Colors
• No.76 Hard Minimum Window Substring
• No.77 Medium Combinations
• No.78 Medium Subsets
• No.79 Medium Word Search
• No.80 Medium Remove Duplicates from Sorted Array II
• No.81 Medium Search in Rotated Sorted Array II
• No.82 Medium Remove Duplicates from Sorted List II
• No.83 Easy Remove Duplicates from Sorted List
• No.84 Hard Largest Rectangle in Histogram
• No.85 Hard Maximal Rectangle
• No.86 Medium Partition List
• No.87 Hard Scramble String
• No.88 Easy Merge Sorted Array
• No.90 Medium Subsets II
• No.91 Medium Decode Ways
• No.92 Medium Reverse Linked List II
• No.93 Medium Restore IP Addresses
• No.94 Medium Binary Tree Inorder Traversal
• No.95 Medium Unique Binary Search Trees II
• No.96 Medium Unique Binary Search Trees
• No.97 Hard Interleaving String
• No.98 Medium Validate Binary Search Tree
• No.99 Hard Recover Binary Search Tree
• No.100 Easy Same Tree
• No.101 Easy Symmetric Tree
• No.102 Medium Binary Tree Level Order Traversal
• No.103 Medium Binary Tree Zigzag Level Order Traversal
• No.104 Easy Maximum Depth of Binary Tree
• No.105 Medium Construct Binary Tree from Preorder and Inorder Traversal
• No.106 Medium Construct Binary Tree from Inorder and Postorder Traversal
• No.107 Easy Binary Tree Level Order Traversal II
• No.108 Easy Convert Sorted Array to Binary Search Tree
• No.109 Medium Convert Sorted List to Binary Search Tree
• No.110 Easy Balanced Binary Tree
• No.111 Easy Minimum Depth of Binary Tree
• No.112 Easy Path Sum
• No.113 Medium Path Sum II
• No.114 Medium Flatten Binary Tree to Linked List
• No.116 Medium Populating Next Right Pointers in Each Node
• No.117 Medium Populating Next Right Pointers in Each Node II
• No.118 Easy Pascal's Triangle
• No.119 Easy Pascal's Triangle II
• No.120 Medium Triangle
• No.121 Easy Best Time to Buy and Sell Stock
• No.122 Easy Best Time to Buy and Sell Stock II
• No.123 Hard Best Time to Buy and Sell Stock III
• No.124 Hard Binary Tree Maximum Path Sum
• No.125 Easy Valid Palindrome
• No.126 Hard Word Ladder II
• No.127 Medium Word Ladder
• No.128 Hard Longest Consecutive Sequence
• No.129 Medium Sum Root to Leaf Numbers
• No.130 Medium Surrounded Regions
• No.131 Medium Palindrome Partitioning
• No.132 Hard Palindrome Partitioning II
• No.133 Medium Clone Graph
• No.134 Medium Gas Station
• No.135 Hard Candy
• No.136 Easy Single Number
• No.137 Medium Single Number II
• No.138 Medium Copy List with Random Pointer
• No.139 Medium Word Break
• No.140 Hard Word Break II
• No.141 Easy Linked List Cycle
• No.142 Medium Linked List Cycle II
• No.143 Medium Reorder List
• No.144 Medium Binary Tree Preorder Traversal
• No.145 Hard Binary Tree Postorder Traversal
• No.146 Hard LRU Cache
• No.147 Medium Insertion Sort List
• No.148 Medium Sort List
• No.150 Medium Evaluate Reverse Polish Notation
• No.151 Medium Reverse Words in a String
• No.152 Medium Maximum Product Subarray
• No.153 Medium Find Minimum in Rotated Sorted Array
• No.154 Hard Find Minimum in Rotated Sorted Array II
• No.155 Easy Min Stack
• No.160 Easy Intersection of Two Linked Lists
• No.162 Medium Find Peak Element
• No.164 Hard Maximum Gap
• No.165 Medium Compare Version Numbers
• No.166 Medium Fraction to Recurring Decimal
• No.167 Easy Two Sum II - Input array is sorted
• No.168 Easy Excel Sheet Column Title
• No.169 Easy Majority Element
• No.171 Easy Excel Sheet Column Number
• No.172 Easy Factorial Trailing Zeroes
• No.173 Medium Binary Search Tree Iterator
• No.174 Hard Dungeon Game
• No.175 Easy Combine Two Tables
• No.179 Medium Largest Number
• No.187 Medium Repeated DNA Sequences
• No.188 Hard Best Time to Buy and Sell Stock IV
• No.189 Easy Rotate Array
• No.204 Easy Count Primes
• No.206 Easy Reverse Linked List
• No.208 Medium Implement Trie (Prefix Tree)
• No.209 Medium Minimum Size Subarray Sum
• No.211 Medium Add and Search Word - Data structure design
• No.212 Hard Word Search II
• No.215 Medium Kth Largest Element in an Array
• No.217 Easy Contains Duplicate
• No.219 Easy Contains Duplicate II
• No.220 Medium Contains Duplicate III
• No.225 Easy Implement Stack using Queues
• No.229 Medium Majority Element II
• No.230 Medium Kth Smallest Element in a BST
• No.231 Easy Power of Two
• No.232 Easy Implement Queue using Stacks
• No.234 Easy Palindrome Linked List
• No.240 Medium Search a 2D Matrix II
• No.260 Medium Single Number III
• No.263 Easy Ugly Number
• No.264 Medium Ugly Number II
• No.268 Easy Missing Number
• No.274 Medium H-Index
• No.275 Medium H-Index II
• No.278 Easy First Bad Version
• No.279 Medium Perfect Squares
• No.283 Easy Move Zeroes
• No.287 Medium Find the Duplicate Number
• No.344 Easy Reverse String
• No.347 Medium Top K Frequent Elements
• No.349 Easy Intersection of Two Arrays
• No.350 Easy Intersection of Two Arrays II
• No.363 Hard Max Sum of Rectangle No Larger Than K
• No.367 Easy Valid Perfect Square
• No.376 Medium Wiggle Subsequence
• No.380 Medium Insert Delete GetRandom O(1)
• No.387 Easy First Unique Character in a String
• No.389 Easy Find the Difference
• No.409 Easy Longest Palindrome
• No.442 Easy Find All Duplicates in an Array
• No.445 Medium Add Two Numbers II
• No.448 Easy Find All Numbers Disappeared in an Array
• No.451 Medium Sort Characters By Frequency
• No.454 Medium 4Sum II
• No.460 Hard LFU Cache
• No.486 Medium Predict the Winner
• No.523 Medium Continuous Subarray Sum
• No.530 Easy Minimum Absolute Difference in BST
• No.541 Easy Reverse String II
• No.560 Medium Subarray Sum Equals K
• No.599 Easy Minimum Index Sum of Two Lists
• No.621 Medium Task Scheduler
• No.633 Easy Sum of Square Numbers
• No.653 Easy Two Sum IV - Input is a BST
• No.658 Medium Find K Closest Elements
• No.659 Medium Split Array into Consecutive Subsequences
• No.680 Easy Valid Palindrome II
• No.718 Medium Maximum Length of Repeated Subarray

LeetCode - Swift4 Solution

• No.01 Easy Two Sum
• No.02 Medium Add Two Numbers
• No.03 Medium Longest Substring Without Repeating Characters
• No.04 Hard Median of Two Sorted Arrays
• No.05 Medium Longest Palindromic Substring
• No.06 Medium ZigZag Conversion
• No.07 Easy Reverse Integer
• No.08 Medium String to Integer (atoi)
• No.09 Easy Palindrome Number
• No.10 Hard Regular Expression Matching
• No.11 Medium Container With Most Water
• No.12 Medium Integer to Roman

Run demo

对于 JavaScript：

• 环境要求：>= Node.js v7
• 如果 Node 版本较低，则可以自行选择使用 Babel 进行转换
• Leetcode 题解代码直接在浏览器中即可运行（ES5/ES6 语法）
• 直接运行各个文件夹下的 js 文件即可查看算法运行的结果，例如在项目根目录下 node ./priority-queues/binary-heaps.js

对于 Swift：

• Swift 版本 >= 4.0