##LeetCode Online Judge : https://leetcode.com/
Linus Torvalds :"Talk is cheap, show me the code. "
##题目
| # | Title | my code | Difficulty | |
|---|---|---|---|---|
| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [golang](./algorithms/Intersection_of_Two_Arrays.go) | Easy | |
| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [golang](./algorithms/Top_K_Frequent_Elements.go) | Medium | |
| 1 | [Two Sums](https://leetcode.com/problems/two-sum/) | [python](./Two_Sum.py) | Medium | |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [python](./Add_Two_Numbers.py) | Medium | |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [python](./Longest_Substring_Without_Repeating_Characters.py) | Medium | |
| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [python](./Median_of_Two_Sorted_Arrays.py) | Hard | |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [python](./Longest_Palindromic_Substring.py) | Medium | |
| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | [python](./algorithms/ZigZag_Conversion.py) | Easy | |
| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [python](./Reverse_Integer.py) | Easy | |
| 8 | [String to Integer (atoi) ](https://leetcode.com/problems/string-to-integer-atoi/) | [python](./algorithms/String_to_Integer%20(atoi).py) | Easy | |
| 9 | [Palindrome Number) ](https://leetcode.com/problems/palindrome-number/) | [python](./algorithms/Palindrome_Number.py) | Easy | |
| 10 | [Regular Expression Matching ) ](https://leetcode.com/problems/regular-expression-matching/) | --- | Hard | 超时，只能用动态规划 |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [python](./Container_With_Most_Water.py) | Medium | |
| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | [python](./algorithms/Integer_to_Roman.py) | Medium | |
| 13 | [Roman to Integer ](https://leetcode.com/problems/roman-to-integer/) | [python](./algorithms/Roman_to_Integer.py) | Easy | |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [c](./algorithms/Longest_Common_Prefix.c) | Easy | |
| 15 | [3Sum ](https://leetcode.com/problems/3sum/) | [python](./algorithms/3Sum.py) | Medium | 性能差，方法不好，待重写 |
| 16 | [3Sum Closest ](https://leetcode.com/problems/3sum-closest/) | [python](./3Sum_Closest.py) | Medium | |
| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [c++](./algorithms/Letter_Combinations_of_a_Phone_Number.cpp) | Medium | |
| 19 | [Remove Nth Node From End of List ](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [c++](./algorithms/Remove_Nth_Node_From_End_of_List.cpp) | Easy | |
| 20 | [Valid Parentheses ](https://leetcode.com/problems/valid-parentheses/) | [python](./algorithms/Valid_Parentheses.py) | Easy | |
| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [c](./algorithms/Merge_Two_Sorted_Lists.c) | Easy |