LeetCode Algorithm Menu (算法目录)

LeetCode Algorithm Menu (算法目录)

这个目录是记录 LeetCode 算法题的过程，其中代码使用的是C++，不定期更新。

其中一些中会有解释与注释，大部分是没有解释与注释的。

---

---

Number 0001 - 0050

#	Title	Difficulty	Tag
0001	Two Sum	Easy
0002	Add Two Numbers	Medium
0003	Longest Substring Without Repeating Characters	Medium
0004	Median of Two Sorted Arrays	Hard	Binary-search
0005	Longest Palindromic Substring	Medium
0006	ZigZag Conversion	Medium
0007	Reverse Integer	Easy
0008	String to Integer (atoi)	Medium
0009	Palindrome Number	Easy
0010	Regular Expression Matching	Hard	Backtracking
0011	Container With Most Water	Medium
0012	Integer to Roman	Medium
0013	Roman to Integer	Easy
0014	Longest Common Prefix	Easy
0015	3Sum	Medium
0016	3Sum Closest	Medium
0017	Letter Combinations of a Phone Number	Medium	Backtracking
0018	4Sum	Medium
0019	Remove Nth Node From End of List	Medium
0020	Valid Parentheses	Easy
0021	Merge Two Sorted Lists	Easy
0022	Generate Parentheses	Medium	Backtracking
0023	Merge k Sorted Lists	Hard	Divide and Conquer
0024	Swap Nodes in Pairs	Medium
0025	Reverse Nodes in k-Group	Hard	Linked List
0026	Remove Duplicates from Sorted Array	Easy
0027	Remove Element	Easy
0028	Implement strStr()	Easy
0029	Divide Two Integers	Medium	Binary-search
0030	Substring with Concatenation of All Words	Hard	Hash Table
0031	Next Permutation	Medium
0032	Longest Valid Parentheses	Hard
0033	Search in Rotated Sorted Array	Medium	Binary-search
0034	Find First and Last Position of Element in Sorted Array	Medium	Binary-search
0035	Search Insert Position	Easy	Binary-search
0036	Valid Sudoku	Medium
0037	Sudoku Solver	Hard	Backtracking
0038	Count and Say	Easy
0039	Combination Sum	Medium	Backtracking
0040	Combination Sum II	Medium	Backtracking
0041	First Missing Positive	Hard	Array
0042	Trapping Rain Water	Hard	Two Pointers
0043	Multiply Strings	Medium
0044	Wildcard Matching	Hard	Dynamic Programming
0045	Jump Game II	Hard	Greedy
0046	Permutations	Medium	Backtracking
0047	Permutations II	Medium	Backtracking
0048	Rotate Image	Medium	Array
0049	Group Anagrams	Medium	Hash Table
0050	Pow(x, n)	Medium	Binary-search

---

Number 0051 - 0100

#	Title	Difficulty	Tag
0051	N-Queens	Hard
0052	N-Queens II	Hard
0053	Maximum Subarray	Easy	Divide and Conquer
0054	Spiral Matrix	Medium
0055	Jump Game	Medium
0056	Merge Intervals	Medium
0057	Insert Interval	Hard
0058	Length of Last Word	Easy
0059	Spiral Matrix II	Medium
0060	Permutation Sequence	Medium	Math Backtracking
0061	Rotate List	Medium	Linked List, Two Pointers
0062	Unique Paths	Medium	Array, Dynamic Programming
0063	Unique Paths II	Medium	Array, Dynamic Programming

---