- Use Node.js(v0.12.0+) to describe
- MacVim as developer tools
-
- Two Sum (https://leetcode.com/problems/two-sum/)
-
- Longest Substring Without Repeating Characters (https://leetcode.com/problems/longest-substring-without-repeating-characters/)
-
- Reverse Integer (https://leetcode.com/problems/reverse-integer/)
-
- String to Integer (atoi) (https://leetcode.com/problems/string-to-integer-atoi/)
-
- Palindrome Number (https://leetcode.com/problems/palindrome-number/)
-
- Integer to roman (https://leetcode.com/problems/integer-to-roman/)
-
- Roman to Integer (https://leetcode.com/problems/roman-to-integer/)
-
- LCP: longest common prefix (https://leetcode.com/problems/longest-common-prefix/)
-
- Letter Combinations of a Phone Number (https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
-
- Valid Parentheses (https://leetcode.com/problems/valid-parentheses/)
-
- Generate Parentheses (https://leetcode.com/problems/generate-parentheses/)
-
- Remove Duplicates from Sorted Array (https://leetcode.com/problems/remove-duplicates-from-sorted-array/)
-
- Remove Element (https://leetcode.com/problems/remove-element/)
- 144.Binary Tree Preorder Traversal (https://leetcode.com/problems/binary-tree-preorder-traversal/)
- 145.Binary Tree Postorder Traversal (https://leetcode.com/problems/binary-tree-postorder-traversal/)
- Code should follow Node.js style standard(https://github.com/felixge/node-style-guide)
- If you find any problem, welcome to report a issue