LeetCode Online Judge

#	Problems	Difficulty	Solutions
1	Two Sum	Easy	Two Sum
2	Add Two Sum	Medium	Add Two Number
3	Longest Substring Without Repeating Characters	Medium	Longest Substring Without Repeating Characters
4	Median of Two Sorted Arrays	Hard	Median of Two Sorted Arrays
5	Longest Palindromic Substring	Medium	Longest Palindromic Substring
10	10. Regular Expression Matching	Hard	10. Regular Expression Matching
12	Integer to Roman	Medium	Integer to Roman
22	Generate Parentheses	Medium	Generate Parentheses
39	Combination Sum	Medium	Combination Sum
42	Trapping Rain Water	Hard	Trapping Rain Water
94	Binary Tree Inorder Traversal	Medium	Binary Tree Inorder Traversal(简书)
108	Convert Sorted Array to Binary Search Tree	Medium	Convert Sorted Array to Binary Search Tree
122	Best Time to Buy and Sell Stock II	Medium	Best Time to Buy and Sell Stock II
136	Single Number	Medium	Single Number(简书)
144	Binary Tree Preorder Traversal	Medium	Binary Tree Preorder Traversal
167	Two Sum II - Input array is sorted	Medium	Two Sum II - Input array is sorted
238	Product of Array Except Self	Medium	Product of Array Except Self(简书)
260	Single Number III	Medium	Single Number III(简书)
268	Missing Number	Medium	Missing Number
309	Best Time to Buy and Sell Stock with Cooldown	Medium	Best Time to Buy and Sell Stock with Cooldown
318	Maximum Product of Word Lengths	Medium	Maximum Product of Word Lengths(简书)
319	Bulb Switcher	Medium	Bulb Switcher(简书)
338	Counting Bits	Medium	Counting Bits(简书)
343	Integer Break	Medium	Integer Break(简书)
347	Top K Frequent Elements	Medium	Top K Frequent Elements(简书)
357	Count Numbers with Unique Digits	Medium	Count Numbers with Unique Digits
377	Combination Sum IV	Medium	Combination Sum IV
492	Construct the Rectangle	Easy	Construct the Rectangle
530	Minimum Absolute Difference in BST	Easy	Minimum Absolute Difference in BST
535	Encode and Decode TinyURL	Medium	Encode and Decode TinyURL
599	Minimum Index Sum of Two Lists	Easy	Minimum Index Sum of Two lists
606	Construct String from Binary Tree	Easy	Construct String from Binary Tree

进度

Github

https://github.com/eazow/leetcode

作者

Eazow

版本

0.2.9.6

更新日志

2016.06.01
347. Top K Frequent Elements

2016.06.03 
319. Bulb Switcher
343. Integer Break
268. Missing Number
144. Binary Tree Preorder Traversal

2016.06.06
94. Binary Tree Inorder Traversal
318. Maximum Product of Word Lengths
12. Integer to Roman

2016.06.13
108. Convert Sorted Array to Binary Search Tree

2016.06.14
357. Count Numbers with Unique Digits

2016.06.20
完成100题
20. Generate Parentheses
309. Best Time to Buy and Sell Stock with Cooldown

2016.08.20
377. Combination Sum IV

2016.09.01
39. Combination Sum 
167. Two Sum II - Input array is sorted

2018.07.25
调整排序为按题号排序，这样比较容易对照leetcode整理

2018.07.26
2. Add Two Numbers
3. Longest Substring Without Repeating Characters
4. Median of Two Sorted Arrays

持续更新中...