fd

Author: liwentian

.DS_Store

@@ -80,6 +80,7 @@
 |56|[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MergeIntervals.java)|70|
 |57|[Insert Interval](https://leetcode.com/problems/insert-interval/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/InsertInterval.java)|75|这题要多做几遍|
 |60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PermutationSequence.java)|70|这题思路巧妙，多做两遍|
+|61|[Rotate List](https://leetcode.com/problems/rotate-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/RotateList.java)|90||
 |66|[Plus One](https://leetcode.com/problems/plus-one/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PlusOne.java)|100|这题多看一遍|
 |67|[Add Binary](https://leetcode.com/problems/add-binary/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/AddBinary.java)|100|
 |68|[Text Justification](https://leetcode.com/problems/text-justification/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/TextJustification.java)||
@@ -99,9 +100,11 @@
 |83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/RemoveDuplicatesFromSortedList.java)|100|
 |84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LargestRectangleInHistogram.java)|70|
 |85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MaximalRectangle.java)|75|
+|86|[Partition List](https://leetcode.com/problems/partition-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PartitionList.java)|90||
 |88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MergeSortedArray.java)|100|
 |90|[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SubsetsII.java)|80|
 |91|[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/DecodeWays.java)|75|这题多做几遍，包括#639|
+|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ReverseLinkedListII.java)|80||
 |93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/RestoreIPAddresses.java)|80|多看两遍|
 |94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/BinaryTreeInorderTraversal.java)|100|
 |95|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/UniqueBinarySearchTreesII.java)|70|多做几遍，递归和DP|
@@ -117,6 +120,7 @@
 |106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ConstructBinaryTreeFromInorderAndPostorderTraversal.java)|90|
 |107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/BinaryTreeLevelOrderTraversalII.java)|100|
 |108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ConvertSortedArrayToBinarySearchTree.java)|100|
+|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ConvertSortedListToBinarySearchTree.java)|90||
 |110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/BalancedBinaryTree.java)|80|
 |111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MinimumDepthOfBinaryTree.java)|80|
 |112|[Path Sum](https://leetcode.com/problems/path-sum/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PathSum.java)|85|
@@ -143,9 +147,13 @@
 |139|[Word Break](https://leetcode.com/problems/word-break/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/WordBreak.java)|80|多看两遍|
 |140|[Word Break II](https://leetcode.com/problems/word-break-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/WordBreakII.java)|75|这题多做两遍，很典型|
 |141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LinkedListCycle.java)|75|
+|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LinkedListCycleII.java)|90||
+|143|[Reorder List](https://leetcode.com/problems/reorder-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ReorderList.java)|90||
 |144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/BinaryTreePreorderTraversal.java)|85|
 |145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/BinaryTreePostorderTraversal.java)|80|
 |146|[LRU Cache](https://leetcode.com/problems/lru-cache/)|[Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LRUCache.java)|95|好题目，多做几遍|
+|147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/InsertionSortList.java)|90||
+|148|[Sort List](https://leetcode.com/problems/sort-list)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SortList.java)|90||
 |149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MaxPointsOnALine.java)|60|
 |151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/description/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ReverseWordsInAString.java)|70|这题虽然不难，但是也错了几次|
 |152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MaximumProductSubarray.java)||
@@ -206,6 +214,7 @@
 |234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PalindromeLinkedList.java)|75|
 |235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)|[Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LowestCommonAncestorOfBinarySearchTree.java)|100|
 |236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LowestCommonAncestorOfBinaryTree.java)|50|这题很经典，多做几遍，留意节点不在树中的情况|
+|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/DeleteNodeInALinkedList.java)|100||
 |238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ProductOfArrayExceptSelf.java)|85|
 |239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SlidingWindowMaximum.java)|75|这题非常经典，多做几遍，包括常规算法(优先队列，treemap)及优化算法双端队列|
 |240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/Search2DMatrixII.java)|100|
@@ -330,6 +339,7 @@
 |437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PathSumIII.java)|60|这道题错了很多遍，要重点关注|
 |438|[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/FindAllAnagramsInString.java)|75|这道题非常经典，最优解法需要多做几遍，保证once bug free|
 |442|[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/FindAllDuplicatesInAnArray.java)|80||
+|445|[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/discuss/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/AddTwoNumbersII.java)|80||
 |448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/FindAllNumbersDisappearedInAnArray.java)|80||
 |449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/SerializeAndDeserializeBST.java)|90|和#297一样|
 |450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/DeleteNodeInBST.java)|60|这题非常经典，值得多做十遍|

README.md

@@ -0,0 +1,110 @@
+\relax 
+\providecommand\hyper@newdestlabel[2]{}
+\FN@pp@footnotehinttrue 
+\@writefile{toc}{\contentsline {chapter}{\numberline {第1章\hspace  {0.3em}}List, Hashtable, Stack, Sort}{1}{chapter.1}}
+\@writefile{lof}{\addvspace {10\p@ }}
+\@writefile{lot}{\addvspace {10\p@ }}
+\@writefile{toc}{\contentsline {section}{\numberline {1.1}Add Two Numbers}{1}{section.1.1}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{1}{section*.2}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{1}{section*.3}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.2}Add Two Numbers II}{2}{section.1.2}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{2}{section*.4}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{2}{section*.5}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.3}Reverse Linked List}{3}{section.1.3}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{3}{section*.6}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution I}{3}{section*.7}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution II}{3}{section*.8}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.4}Reverse Linked List II}{4}{section.1.4}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{4}{section*.9}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{4}{section*.10}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.5}Sort List}{5}{section.1.5}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{5}{section*.11}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{5}{section*.12}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.6}Linked List Cycle}{6}{section.1.6}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{6}{section*.13}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{6}{section*.14}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.7}Linked List Cycle II}{7}{section.1.7}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{7}{section*.15}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{7}{section*.16}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.8}Odd Even Linked List}{8}{section.1.8}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{8}{section*.17}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{8}{section*.18}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.9}Merge Two Sorted Lists}{9}{section.1.9}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{9}{section*.19}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{9}{section*.20}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.10}Intersection of Two Linked Lists}{10}{section.1.10}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{10}{section*.21}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{10}{section*.22}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.11}Copy List with Random Pointer}{11}{section.1.11}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{11}{section*.23}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{11}{section*.24}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.12}Merge k Sorted Lists}{12}{section.1.12}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{12}{section*.25}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{12}{section*.26}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.13}Palindrome Linked List}{13}{section.1.13}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{13}{section*.27}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{13}{section*.28}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.14}Insertion Sort List}{14}{section.1.14}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{14}{section*.29}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{14}{section*.30}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.15}Remove Nth Node From End of List}{15}{section.1.15}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{15}{section*.31}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{15}{section*.32}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.16}Reorder List}{16}{section.1.16}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{16}{section*.33}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{16}{section*.34}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.17}Swap Nodes in Pairs}{17}{section.1.17}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{17}{section*.35}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{17}{section*.36}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.18}Remove Linked List Elements}{18}{section.1.18}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{18}{section*.37}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{18}{section*.38}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.19}Remove Duplicates from Sorted List}{19}{section.1.19}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{19}{section*.39}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{19}{section*.40}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.20}Remove Duplicates from Sorted List II}{20}{section.1.20}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{20}{section*.41}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{20}{section*.42}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.21}Convert Sorted List to Binary Search Tree}{21}{section.1.21}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{21}{section*.43}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{21}{section*.44}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.22}Partition List}{22}{section.1.22}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{22}{section*.45}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{22}{section*.46}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.23}Reverse Nodes in k-Group}{23}{section.1.23}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{23}{section*.47}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{23}{section*.48}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.24}Rotate List}{24}{section.1.24}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{24}{section*.49}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{24}{section*.50}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.25}Plus One Linked List}{25}{section.1.25}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{25}{section*.51}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{25}{section*.52}}
+\@setckpt{List}{
+\setcounter{page}{26}
+\setcounter{equation}{0}
+\setcounter{enumi}{0}
+\setcounter{enumii}{0}
+\setcounter{enumiii}{0}
+\setcounter{enumiv}{0}
+\setcounter{footnote}{0}
+\setcounter{mpfootnote}{0}
+\setcounter{part}{0}
+\setcounter{chapter}{1}
+\setcounter{section}{25}
+\setcounter{subsection}{0}
+\setcounter{subsubsection}{0}
+\setcounter{paragraph}{0}
+\setcounter{subparagraph}{0}
+\setcounter{figure}{0}
+\setcounter{table}{0}
+\setcounter{FancyVerbLine}{22}
+\setcounter{pp@next@reset}{1}
+\setcounter{@fnserial}{0}
+\setcounter{Item}{0}
+\setcounter{Hfootnote}{0}
+\setcounter{Hy@AnnotLevel}{0}
+\setcounter{bookmark@seq@number}{26}
+\setcounter{parentequation}{0}
+\setcounter{section@level}{3}
+}