目录结构调整

inrg · Mar 28, 2019 · 18eec7c · 18eec7c
1 parent f70b631
commit 18eec7c
Show file tree

Hide file tree

Showing 32 changed files with 25 additions and 24 deletions.
diff --git a/.gitignore b/.gitignore
@@ -0,0 +1 @@
+.DS_Store
diff --git a/README.md b/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)
diff --git a/102.binary-tree-level-order-traversal.md → .../102.binary-tree-level-order-traversal.md b/102.binary-tree-level-order-traversal.md → .../102.binary-tree-level-order-traversal.md
diff --git a/...nary-tree-zigzag-level-order-traversal.md → ...nary-tree-zigzag-level-order-traversal.md b/...nary-tree-zigzag-level-order-traversal.md → ...nary-tree-zigzag-level-order-traversal.md
diff --git a/136.single-number.md → problems/136.single-number.md b/136.single-number.md → problems/136.single-number.md
diff --git a/144.binary-tree-preorder-traversal.md → ...ems/144.binary-tree-preorder-traversal.md b/144.binary-tree-preorder-traversal.md → ...ems/144.binary-tree-preorder-traversal.md
diff --git a/145.binary-tree-postorder-traversal.md → ...ms/145.binary-tree-postorder-traversal.md b/145.binary-tree-postorder-traversal.md → ...ms/145.binary-tree-postorder-traversal.md
diff --git a/146.lru-cache.md → problems/146.lru-cache.md b/146.lru-cache.md → problems/146.lru-cache.md
diff --git a/150.evaluate-reverse-polish-notation.md → ...s/150.evaluate-reverse-polish-notation.md b/150.evaluate-reverse-polish-notation.md → ...s/150.evaluate-reverse-polish-notation.md
diff --git a/167.two-sum-ii-input-array-is-sorted.md → ...s/167.two-sum-ii-input-array-is-sorted.md b/167.two-sum-ii-input-array-is-sorted.md → ...s/167.two-sum-ii-input-array-is-sorted.md
diff --git a/199.binary-tree-right-side-view.md → problems/199.binary-tree-right-side-view.md b/199.binary-tree-right-side-view.md → problems/199.binary-tree-right-side-view.md
diff --git a/203.remove-linked-list-elements.md → problems/203.remove-linked-list-elements.md b/203.remove-linked-list-elements.md → problems/203.remove-linked-list-elements.md
diff --git a/206.reverse-linked-list.md → problems/206.reverse-linked-list.md b/206.reverse-linked-list.md → problems/206.reverse-linked-list.md
diff --git a/209.minimum-size-subarray-sum.md → problems/209.minimum-size-subarray-sum.md b/209.minimum-size-subarray-sum.md → problems/209.minimum-size-subarray-sum.md
diff --git a/219.contains-duplicate-ii.md → problems/219.contains-duplicate-ii.md b/219.contains-duplicate-ii.md → problems/219.contains-duplicate-ii.md
diff --git a/26.remove-duplicates-from-sorted-array.md → ...26.remove-duplicates-from-sorted-array.md b/26.remove-duplicates-from-sorted-array.md → ...26.remove-duplicates-from-sorted-array.md
diff --git a/279.perfect-squares.md → problems/279.perfect-squares.md b/279.perfect-squares.md → problems/279.perfect-squares.md
diff --git a/283.move-zeroes.md → problems/283.move-zeroes.md b/283.move-zeroes.md → problems/283.move-zeroes.md
diff --git a/328.odd-even-linked-list.md → problems/328.odd-even-linked-list.md b/328.odd-even-linked-list.md → problems/328.odd-even-linked-list.md
diff --git a/349.intersection-of-two-arrays.md → problems/349.intersection-of-two-arrays.md b/349.intersection-of-two-arrays.md → problems/349.intersection-of-two-arrays.md
diff --git a/445.add-two-numbers-ii.md → problems/445.add-two-numbers-ii.md b/445.add-two-numbers-ii.md → problems/445.add-two-numbers-ii.md
diff --git a/75.sort-colors.md → problems/75.sort-colors.md b/75.sort-colors.md → problems/75.sort-colors.md
diff --git a/86.partition-list.md → problems/86.partition-list.md b/86.partition-list.md → problems/86.partition-list.md
diff --git a/877.stone-game.md → problems/877.stone-game.md b/877.stone-game.md → problems/877.stone-game.md
diff --git a/92.reverse-linked-list-ii.md → problems/92.reverse-linked-list-ii.md b/92.reverse-linked-list-ii.md → problems/92.reverse-linked-list-ii.md
diff --git a/94.binary-tree-inorder-traversal.md → problems/94.binary-tree-inorder-traversal.md b/94.binary-tree-inorder-traversal.md → problems/94.binary-tree-inorder-traversal.md
diff --git a/addTwoNumbers.md → problems/addTwoNumbers.md b/addTwoNumbers.md → problems/addTwoNumbers.md
diff --git a/longestPalindromicSubstring.md → problems/longestPalindromicSubstring.md b/longestPalindromicSubstring.md → problems/longestPalindromicSubstring.md
diff --git a/...estSubstringWithoutRepeatingCharacters.md → ...estSubstringWithoutRepeatingCharacters.md b/...estSubstringWithoutRepeatingCharacters.md → ...estSubstringWithoutRepeatingCharacters.md
diff --git a/removeNthNodeFromEndofList.md → problems/removeNthNodeFromEndofList.md b/removeNthNodeFromEndofList.md → problems/removeNthNodeFromEndofList.md
diff --git a/swapNodesInPairs.md → problems/swapNodesInPairs.md b/swapNodesInPairs.md → problems/swapNodesInPairs.md
diff --git a/validParentheses.md → problems/validParentheses.md b/validParentheses.md → problems/validParentheses.md