LeetCode Using Java

Tree

1. minimum depth of binary tree

Stack

1. Evaluate Reverse Polish Notation(求反波兰式表示法)
2. Valid Parentheses

Link

1. Sort List
2. Sort List
3. Add Two Numbers
4. Remove Nth Node From End of List
5. Merge Two Sorted Lists

Method Of Exhaustion

1. Max Points

Array

1. Two Sum
2. Longest Substring Without Repeating Characters
3. Median of Two Sorted Arrays
4. Container With Most Water
5. 3Sum
6. Remove Duplicates from Sorted Array
7. Search in Rotated Sorted Array
8. Find First and Last Position of Element in Sorted Array

Dynamic Programming

1. Longest Palindromic(回文) Substring

Math

1. Reverse Integer
2. Divide Two Integers

Back Tracking

1. Generate Parentheses
2. Permutations

String

1. ZigZag Conversion
2. String To Integer(atoi)
3. Regular Expression Matching
4. Roman to Integer
5. Longest Common Prefix
6. Letter Combinations of a Phone Number
7. Implement IndexOf()
8. Count and Say