优化文档

Author: diguage

Diff for: docs/0000-data-structure-list.adoc

@@ -15,6 +15,10 @@
 
 详情见 xref:0000-09-monotonic-stack.adoc[Monotonic Stack 单调栈]
 
+=== 其他技巧
+
+. 将链表做成环，比如 xref:0061-rotate-list.adoc[61. Rotate List]。
+
 
 
 == 参考资料

Diff for: docs/0061-rotate-list.adoc

@@ -32,41 +32,14 @@ image::images/0061-1.png[{image_attr}]
 
 这个环形解题法很赞！
 
-== 参考资料
-
-. https://leetcode-cn.com/problems/rotate-list/solution/xuan-zhuan-lian-biao-by-leetcode/[旋转链表 - 旋转链表 - 力扣（LeetCode）^]
-
-
-Given a linked list, rotate the list to the right by _k_ places, where _k_ is non-negative.
-
-*Example 1:*
-
-[subs="verbatim,quotes,macros"]
-----
-*Input:* 1->2->3->4->5->NULL, k = 2
-*Output:* 4->5->1->2->3->NULL
-*Explanation:*
-rotate 1 steps to the right: 5->1->2->3->4->NULL
-rotate 2 steps to the right: 4->5->1->2->3->NULL
-----
-
-*Example 2:*
-
-[subs="verbatim,quotes,macros"]
-----
-*Input:* 0->1->2->NULL, k = 4
-*Output:* `2->0->1->NULL`
-*Explanation:*
-rotate 1 steps to the right: 2->0->1->NULL
-rotate 2 steps to the right: 1->2->0->NULL
-rotate 3 steps to the right: `0->1->2->NULL`
-rotate 4 steps to the right: `2->0->1->NULL`
-----
-
-
 [[src-0061]]
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0061_RotateList.java[tag=answer]
 ----
 
+== 参考资料
+
+. https://leetcode-cn.com/problems/rotate-list/solution/xuan-zhuan-lian-biao-by-leetcode/[旋转链表 - 旋转链表 - 力扣（LeetCode）^]
+
+

Diff for: docs/0092-reverse-linked-list-ii.adoc

@@ -23,6 +23,11 @@ Output: 1->4->3->2->5->NULL
 
 最后再将三个拼接在一起。
 
+[[src-0092]]
+[{java_src_attr}]
+----
+include::{sourcedir}/_0092_ReverseLinkedListII.java[tag=answer]
+----
 
 == 思考题
 
@@ -32,23 +37,3 @@ Output: 1->4->3->2->5->NULL
 
 . https://leetcode-cn.com/problems/reverse-linked-list-ii/solution/fan-zhuan-lian-biao-ii-by-leetcode/[反转链表 II - 反转链表 II - 力扣（LeetCode）^]
 
-
-Reverse a linked list from position _m_ to _n_. Do it in one-pass.
-
-*Note: *1 ≤ _m_ ≤ _n_ ≤ length of list.
-
-*Example:*
-
-[subs="verbatim,quotes,macros"]
-----
-*Input:* 1->2->3->4->5->NULL, _m_ = 2, _n_ = 4
-*Output:* 1->4->3->2->5->NULL
-----
-
-
-[[src-0092]]
-[{java_src_attr}]
-----
-include::{sourcedir}/_0092_ReverseLinkedListII.java[tag=answer]
-----
-

Diff for: src/main/java/com/diguage/algo/leetcode/_0061_RotateList.java

@@ -24,6 +24,9 @@ public class _0061_RotateList {
      * Memory Usage: 38.8 MB, less than 46.55% of Java online submissions for Rotate List.
      *
      * Copy from: https://leetcode-cn.com/problems/rotate-list/solution/xuan-zhuan-lian-biao-by-leetcode/[旋转链表 - 旋转链表 - 力扣（LeetCode）]
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-02-01 23:11
      */
     public ListNode rotateRight(ListNode head, int k) {
         if (Objects.isNull(head) || Objects.isNull(head.next) || k == 0) {

Diff for: src/main/java/com/diguage/algo/leetcode/_0092_ReverseLinkedListII.java

@@ -21,6 +21,9 @@ public class _0092_ReverseLinkedListII {
     /**
      * Runtime: 0 ms, faster than 100.00% of Java online submissions for Reverse Linked List II.
      * Memory Usage: 36.6 MB, less than 11.36% of Java online submissions for Reverse Linked List II.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-02-05 22:46
      */
     public ListNode reverseBetween(ListNode head, int m, int n) {
         if (m == n) {