目录结构调整

problems/26.remove-duplicates-from-sorted-array.md

@@ -51,7 +51,7 @@ for (int i = 0; i < len; i++) {
 
 - 当快指针走完整个数组后，慢指针当前的坐标加1就是数组中不同数字的个数
 
-![26.remove-duplicates-from-sorted-array](./assets/26.remove-duplicates-from-sorted-array.gif)
+![26.remove-duplicates-from-sorted-array](../assets/26.remove-duplicates-from-sorted-array.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 

problems/86.partition-list.md

@@ -19,7 +19,7 @@ Output: 1->2->2->4->3->5
 
 遍历结束后，将dummyHead2插入到dummyHead1后面
 
-![86.partition-list](./assets/86.partition-list.gif)
+![86.partition-list](../assets/86.partition-list.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 ## 关键点解析

problems/92.reverse-linked-list-ii.md

@@ -27,7 +27,7 @@ Output: 1->4->3->2->5->NULL
 
 这样我们就可以把倒置后的那一小段链表加入到原链表中
 
-![92.reverse-linked-list-ii](./assets/92.reverse-linked-list-ii.gif)
+![92.reverse-linked-list-ii](../assets/92.reverse-linked-list-ii.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 ## 关键点解析

problems/94.binary-tree-inorder-traversal.md

@@ -30,7 +30,7 @@ Follow up: Recursive solution is trivial, could you do it iteratively?
 
 - 再将当前指针移到其右子节点上，若存在右子节点，则在下次循环时又可将其所有左子结点压入栈中， 重复上步骤
 
-![94.binary-tree-inorder-traversal](./assets/94.binary-tree-inorder-traversal.gif)
+![94.binary-tree-inorder-traversal](../assets/94.binary-tree-inorder-traversal.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 ## 关键点解析

problems/addTwoNumbers.md

@@ -18,7 +18,7 @@ Explanation: 342 + 465 = 807.
 设立一个表示进位的变量carried，建立一个新链表，
 把输入的两个链表从头往后同时处理，每两个相加，将结果加上carried后的值作为一个新节点到新链表后面。
 
-![2.addTwoNumbers](./assets/2.addTwoNumbers.gif)
+![2.addTwoNumbers](../assets/2.addTwoNumbers.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 

problems/longestSubstringWithoutRepeatingCharacters.md

@@ -23,7 +23,7 @@ Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer
 
 （4）维护一个结果res，每次用出现过的窗口大小来更新结果res，最后返回res获取结果。
 
-![3.longestSubstringWithoutRepeatingCharacters](./assets/3.longestSubstringWithoutRepeatingCharacters.gif)
+![3.longestSubstringWithoutRepeatingCharacters](../assets/3.longestSubstringWithoutRepeatingCharacters.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 

problems/removeNthNodeFromEndofList.md

@@ -35,7 +35,7 @@ Could you do this in one pass?
 
 
 
-![19.removeNthNodeFromEndOfList](./assets/19.removeNthNodeFromEndOfList.gif)
+![19.removeNthNodeFromEndOfList](../assets/19.removeNthNodeFromEndOfList.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 

problems/swapNodesInPairs.md

@@ -24,7 +24,7 @@ Given 1->2->3->4, you should return the list as 2->1->4->3.
 7. current 移动两格
 8. 重复
 
-![24.swap-nodes-in-pairs](./assets/24.swap-nodes-in-pairs.gif)
+![24.swap-nodes-in-pairs](../assets/24.swap-nodes-in-pairs.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)
 

problems/validParentheses.md

@@ -48,7 +48,7 @@ Output: true
 
 
 
-![20.validParentheses](./assets/20.validParentheses.gif)
+![20.validParentheses](../assets/20.validParentheses.gif)
 
 (图片来自： https://github.com/MisterBooo/LeetCodeAnimation)