LeetCode

---

Solved Question
92/917

---

Difficulty	Problems	Description && Solution	remarks
Easy	1. Two Sum	Solution
Medium	2. Add Two Numbers/	Solution
Medium	3. Longest Substring Without Repeating Characters	Solution
Hard	4. Median of Two Sorted Arrays	Solution
Hard	4. Median of Two Sorted Arrays	Solution	python
Medium	5. Longest Palindramic Substring	Solution
Medium	6. ZigZag Conversion	Solution	1
Medium	6. ZigZag Conversion	Solution	2
Easy	7. Reverse Integer	Solution
Medium	8. String to Integer(atoi)	Solution
Easy	9. Palindrome Number	Solution
Hard	10. Regular Expression Matching	Solution	大神解法
Hard	10. Regular Expression Matching	Solution	大神解法
Hard	10. Regular Expression Matching	Solution	my wrong answer
Medium	11. Container With Most Water	Solution
Easy	35. Search Insert Position	Solution	Binary search
Easy	102. Binary Tree Level Order Traversal	Solution	Binary Tree
Easy	104. Maximum Depth of Binary Tree	Solution	Binary Tree
Hard	132. Palindrome Partitioning II	Solution
Hard	135. Candy	Solution
Medium	162. Find Peak Element	Solution	与852一个类型,这里的解法也一样
Medium	338. Counting Bits	Solution
Medium	343. Integer Break	Solution	DP
Easy	344. Reverse String	Solution	字符串
Easy	412. Fizz Buzz	Solution
Medium	413. Arithmetic Slices	Solution	DP
Medium	419. Battleships in a Board	Solution
Easy	429. N-ary Tree Level Order Traversal	Solution	Tree
Easy	442. Find All Duplicates in an Array	Solution	要求不用辅助空间，时间O(n)， 只能参考大神解法
Easy	461. Hamming Distance	Solution
Easy	463. Island Perimeter	Solution
Easy	476. Number Complement	Solution1,Solution2	移位运算
Easy	500. Keyboard Row	Solution
Medium	535. Encode and Decode TinyURL	Solution
Medium	537. Complex Number Multiplication	Solution
Medium	540. Single Element in a Sorted Array	Solution	二分查找
Easy	557. Reverse Words in a String III	Solution	字符串
Easy	559. Maximum Depth of N-ary Tree	Solution-recursion	求多叉树的深度,递归方法
Easy	561. Array Partition I	Solution
Easy	566. Reshape the Matrix	Solution	i/c,i%c
Easy	589. N-ary Tree Preorder Traversal	Solution	递归
Easy	590. N-ary Tree Postorder Traversal	Solution	递归
Easy	595. Big Countries	Solution	SQL
Easy	617. Merge Two Binary Trees	Solution	binary tree
Medium	647. Palindromic Substrings	Solution	DP
Medium	647. Palindromic Substrings	Solution	大神解法
Medium	654. Maximum Binary Tree	Solution
Easy	657. Robot Return to Origin	Solution
Easy	682. Baseball Game	Solution
Easy	700. Search in a Binary Search Tree	Solution
Medium	701. Insert into a Binary Search Tree	Solution
Easy	709. To Lower Case	Solution
Medium	712. Minimum ASCII Delete Sum for Two Strings	Solution	DP
Medium	712. Minimum ASCII Delete Sum for Two Strings	Solution	my wrong answer
Medium	714. Best Time to Buy and Sell Stock with Transaction Fee	Solution	这道太难了，看了看大神的解法
Easy	728. Self Dividing Numbers	Solution
Medium	763. Partition Labels	Solution
Easy	766. Toeplitz Matrix	Solution	太简单了
Easy	771. Jewels and Stones	Solution
Medium	[791. Custom Sort String](https://leetcode.com/problems/custom sort string/description/)	Solution	string
Medium	797. All Paths From Source to Target	Solution	Graph DFS
Easy	804. Unique Morse Code Words	Solution
Easy	806. Number of Lines To Write String	Solution
Medium	807. Max Increase to Keep City Skyline	Solution
Easy	811. Subdomain Visit Count	Solution	被substr()坑惨了
Medium	814. Binary Tree Prunning	Solution
Easy	821. Shortest Distance to a Character	Solution	看了大神解法后自己写的
Easy	832. Flipping an Image	Solution
Easy	852. Peak Index in a Mountain Array	Solution	162
Medium	861. Score After Flipping Matrix	Solution
Easy	867. Transpose Matrix	Solution
Easy	868. Binary Gap	Solution
Easy	872. Leaf-Similar Trees	Solution
Easy	876. Middle of the Linked List	Solution
Medium	877. Stone Game	Solution	DP，但可以直接return true
Easy	883. Projection Area of 3D Shapes	Solution
Easy	884. Uncommon Words from Two Sentences	Solution
Medium	885. Spiral Matrix III	Solution
Medium	890. Find and Replace Pattern	Solution
Medium	893. Groups of Special-Equivalent Strings	Solution
Easy	897. Increasing Order Search Tree	Solution	tree
Easy	905. Sort Array By Parity	Solution
Easy	908. Smallest Range I	Solution
		Solution