目录结构调整

.gitignore

+.DS_Store
\ No newline at end of file

README.md

@@ -6,15 +6,15 @@ leetcode 题解，记录自己的 leecode 解题之路。
 
 ### 简单难度
 
-- [20. Valid Parentheses](https://github.com/azl397985856/leetcode/blob/master/validParentheses.md)
-- [26.remove-duplicates-from-sorted-array](https://github.com/azl397985856/leetcode/blob/master/26.remove-duplicates-from-sorted-array.md)
-- [206.reverse-linked-list](./206.reverse-linked-list.md)
-- [136.single-number](./136.single-number.md)
-- [167.two-sum-ii-input-array-is-sorted](./167.two-sum-ii-input-array-is-sorted.md)
-- [203.remove-linked-list-elements](./203.remove-linked-list-elements.md)
-- [219.contains-duplicate-ii](./219.contains-duplicate-ii.md)
-- [283.move-zeroes](./283.move-zeroes.md)
-- [349.intersection-of-two-arrays](./349.intersection-of-two-arrays.md)
+- [20. Valid Parentheses](./problems/validParentheses.md)
+- [26.remove-duplicates-from-sorted-array](./problems/26.remove-duplicates-from-sorted-array.md)
+- [206.reverse-linked-list](./problems/206.reverse-linked-list.md)
+- [136.single-number](./problems/136.single-number.md)
+- [167.two-sum-ii-input-array-is-sorted](./problems/167.two-sum-ii-input-array-is-sorted.md)
+- [203.remove-linked-list-elements](./problems/203.remove-linked-list-elements.md)
+- [219.contains-duplicate-ii](./problems/219.contains-duplicate-ii.md)
+- [283.move-zeroes](./problems/283.move-zeroes.md)
+- [349.intersection-of-two-arrays](./problems/349.intersection-of-two-arrays.md)
 
 ### 中等难度
 
@@ -24,21 +24,21 @@ leetcode 题解，记录自己的 leecode 解题之路。
 - [19. Remove Nth Node From End of List](https://github.com/azl397985856/leetcode/blob/master/removeNthNodeFromEndofList.md)
 - [24. Swap Nodes In Pairs](https://github.com/azl397985856/leetcode/blob/master/swapNodesInPairs.md)
 - [75.sort-colors.md](https://github.com/azl397985856/leetcode/blob/master/75.sort-colors.md)
-- [86.partition-list](./86.partition-list.md)
-- [92.reverse-linked-list-ii](./92.reverse-linked-list-ii.md)
-- [94.binary-tree-inorder-traversal](./94.binary-tree-inorder-traversal.md)
-- [102.binary-tree-level-order-traversal](./102.binary-tree-level-order-traversal.md)
-- [103.binary-tree-zigzag-level-order-traversal](./103.binary-tree-zigzag-level-order-traversal.md)
-- [144.binary-tree-preorder-traversal](./144.binary-tree-preorder-traversal.md)
-- [150.evaluate-reverse-polish-notation](./150.evaluate-reverse-polish-notation.md)
-- [328.odd-even-linked-list](./328.odd-even-linked-list.md)
-- [445.add-two-numbers-ii](./445.add-two-numbers-ii.md)
-- [877.stone-game](./877.stone-game.md)
-- [279.perfect-squares](./279.perfect-squares.md)
-- [199.binary-tree-right-side-view](./199.binary-tree-right-side-view.md)
-- [209.minimum-size-subarray-sum](./209.minimum-size-subarray-sum.md)
+- [86.partition-list](./problems/86.partition-list.md)
+- [92.reverse-linked-list-ii](./problems/92.reverse-linked-list-ii.md)
+- [94.binary-tree-inorder-traversal](./problems/94.binary-tree-inorder-traversal.md)
+- [102.binary-tree-level-order-traversal](./problems/102.binary-tree-level-order-traversal.md)
+- [103.binary-tree-zigzag-level-order-traversal](./problems/103.binary-tree-zigzag-level-order-traversal.md)
+- [144.binary-tree-preorder-traversal](./problems/144.binary-tree-preorder-traversal.md)
+- [150.evaluate-reverse-polish-notation](./problems/150.evaluate-reverse-polish-notation.md)
+- [328.odd-even-linked-list](./problems/328.odd-even-linked-list.md)
+- [445.add-two-numbers-ii](./problems/445.add-two-numbers-ii.md)
+- [877.stone-game](./problems/877.stone-game.md)
+- [279.perfect-squares](./problems/279.perfect-squares.md)
+- [199.binary-tree-right-side-view](./problems/199.binary-tree-right-side-view.md)
+- [209.minimum-size-subarray-sum](./problems/209.minimum-size-subarray-sum.md)
 
 ### 困难难度
 
-- [145.binary-tree-postorder-traversal](./145.binary-tree-postorder-traversal.md)
-- [146.lru-cache](./146.lru-cache.md)
+- [145.binary-tree-postorder-traversal](./problems/145.binary-tree-postorder-traversal.md)
+- [146.lru-cache](./problems/146.lru-cache.md)