Name		Name	Last commit message	Last commit date
Latest commit History 130 Commits
.circleci		.circleci
Add-One-Row-to-Tree		Add-One-Row-to-Tree
Anagrams		Anagrams
Average-of-Levels-in-Binary-Tree		Average-of-Levels-in-Binary-Tree
Balanced-Binary-Tree		Balanced-Binary-Tree
Best-Time-to-Buy-and-Sell-Stock-II		Best-Time-to-Buy-and-Sell-Stock-II
Best-Time-to-Buy-and-Sell-Stock		Best-Time-to-Buy-and-Sell-Stock
Binary-Search-Tree-Iterator		Binary-Search-Tree-Iterator
Binary-Tree-Inorder-Traversal		Binary-Tree-Inorder-Traversal
Binary-Tree-Maximum-Path-Sum		Binary-Tree-Maximum-Path-Sum
Binary-Tree-Postorder-Traversal		Binary-Tree-Postorder-Traversal
Binary-Tree-Preorder-Traversal		Binary-Tree-Preorder-Traversal
Binary-Tree-Tilt		Binary-Tree-Tilt
Binary-Tree-Upside-Down		Binary-Tree-Upside-Down
Candy		Candy
Compare-Version-Numbers		Compare-Version-Numbers
Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal		Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal
Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal		Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal
Construct-String-from-Binary-Tree		Construct-String-from-Binary-Tree
Convert-BST-to-Greater-Tree		Convert-BST-to-Greater-Tree
Convert-Sorted-Array-to-Binary-Search-Tree		Convert-Sorted-Array-to-Binary-Search-Tree
Delete-Node-in-a-BST		Delete-Node-in-a-BST
Diameter-of-Binary-Tree		Diameter-of-Binary-Tree
Dungeon-Game		Dungeon-Game
Duplicate-Emails		Duplicate-Emails
Excel-Sheet-Column-Number		Excel-Sheet-Column-Number
Excel-Sheet-Column-Title		Excel-Sheet-Column-Title
Factorial-Trailing-Zeroes		Factorial-Trailing-Zeroes
Find-Duplicate-Subtrees		Find-Duplicate-Subtrees
Find-Largest-Value-in-Each-Tree-Row		Find-Largest-Value-in-Each-Tree-Row
Find-Minimum-in-Rotated-Sorted-Array-II		Find-Minimum-in-Rotated-Sorted-Array-II
Find-Minimum-in-Rotated-Sorted-Array		Find-Minimum-in-Rotated-Sorted-Array
Find-Mode-in-Binary-Search-Tree		Find-Mode-in-Binary-Search-Tree
Find-Peak-Element		Find-Peak-Element
Find-Smallest-Letter-Greater-Than-Target		Find-Smallest-Letter-Greater-Than-Target
Generate-Parentheses		Generate-Parentheses
Gray-Code		Gray-Code
Intersection-of-Two-Linked-Lists		Intersection-of-Two-Linked-Lists
Jump-Game-II		Jump-Game-II
Jump-Game		Jump-Game
K-th-Symbol-in-Grammar		K-th-Symbol-in-Grammar
Largest-Number-At-Least-Twice-of-Others		Largest-Number-At-Least-Twice-of-Others
Largest-Number		Largest-Number
Linked-List-Cycle-II		Linked-List-Cycle-II
Linked-List-Cycle		Linked-List-Cycle
Longest-Substring-with-At-Most-Two-Distinct-Characters		Longest-Substring-with-At-Most-Two-Distinct-Characters
Majority-Element		Majority-Element
Maximum-Binary-Tree		Maximum-Binary-Tree
Maximum-Depth-of-Binary-Tree		Maximum-Depth-of-Binary-Tree
Maximum-Width-of-Binary-Tree		Maximum-Width-of-Binary-Tree
Median-of-Two-Sorted-Arrays		Median-of-Two-Sorted-Arrays
Merge-Sorted-Array		Merge-Sorted-Array
Min-Cost-Climbing-Stairs		Min-Cost-Climbing-Stairs
Min-Stack		Min-Stack
Minimum-Path-Sum		Minimum-Path-Sum
Missing-Ranges		Missing-Ranges
Most-Frequent-Subtree-Sum		Most-Frequent-Subtree-Sum
One-Edit-Distance		One-Edit-Distance
Palindrome-Number		Palindrome-Number
Path-Sum-II		Path-Sum-II
Path-Sum-III		Path-Sum-III
Path-Sum		Path-Sum
Plus-One		Plus-One
Populating-Next-Right-Pointers-in-Each-Node		Populating-Next-Right-Pointers-in-Each-Node
Print-Binary-Tree		Print-Binary-Tree
Remove-Duplicates-from-Sorted-Array		Remove-Duplicates-from-Sorted-Array
Remove-Duplicates-from-Sorted-List		Remove-Duplicates-from-Sorted-List
Reverse-Integer		Reverse-Integer
Reverse-Linked-List		Reverse-Linked-List
Reverse-Words-in-a-String-II		Reverse-Words-in-a-String-II
Reverse-Words-in-a-String		Reverse-Words-in-a-String
Same-Tree		Same-Tree
Search-a-2D-Matrix		Search-a-2D-Matrix
Second-Minimum-Node-In-a-Binary-Tree		Second-Minimum-Node-In-a-Binary-Tree
Serialize-and-Deserialize-BST		Serialize-and-Deserialize-BST
Shortest-Palindrome		Shortest-Palindrome
Single-Number-II		Single-Number-II
Single-Number		Single-Number
Sort-List		Sort-List
Sqrt		Sqrt
Subtree-of-Another-Tree		Subtree-of-Another-Tree
Tenth-Line		Tenth-Line
Triangle		Triangle
Two-Sum-II		Two-Sum-II
Two-Sum-III		Two-Sum-III
Two-Sum		Two-Sum
Unique-Binary-Search-Trees		Unique-Binary-Search-Trees
Unique-Paths-II		Unique-Paths-II
Unique-Paths		Unique-Paths
Valid-Anagram		Valid-Anagram
Valid-Number		Valid-Number
Valid-Palindrome		Valid-Palindrome
Valid-Parentheses		Valid-Parentheses
Valid-Phone-Numbers		Valid-Phone-Numbers
.gitignore		.gitignore
.travis.yml		.travis.yml
Dockerfile		Dockerfile
Makefile		Makefile
README.md		README.md
solution		solution

Repository files navigation

LeetCode

The solutions of LeetCode, include Java, C, Python version.

The C and Java codes need compile. just use make to compile them. make clean will delete all compiled files.

I've completed all problems of LeetCode by Java. You can see my screenshot in the end (it's pretty long).

I plan to revise and publish all my solutions by three different languages.

20141029 by xcv58

xcv58/LeetCode

Folders and files

Latest commit

History