test 32

chenweijie · chenweijie · commit abccc79f8af9 · 2020-05-27T18:12:02.000+08:00
diff --git a/src/main/java/com/chen/algorithm/study/test92/Solution.java b/src/main/java/com/chen/algorithm/study/test92/Solution.java
@@ -0,0 +1,47 @@
+package com.chen.algorithm.study.test92;
+
+
+/**
+ * @author Chen WeiJie
+ * @date 2020-05-27 17:39:32
+ **/
+public class Solution {
+
+
+    public class ListNode {
+        int val;
+        ListNode next;
+
+        ListNode(int x) {
+            val = x;
+        }
+    }
+
+
+    public ListNode reverseBetween(ListNode head, int m, int n) {
+
+        if (head == null) {
+            return null;
+        }
+
+        ListNode pre = new ListNode(1);
+        pre.next = head;
+        ListNode ans = pre;
+
+        for (int i = 0; i < m - 1; i++) {
+            pre = pre.next;
+        }
+
+        ListNode end = pre.next;
+
+        for (int i = m; i < n; i++) {
+
+            ListNode temp = end.next;
+            end.next = temp.next;
+            temp.next = pre.next;
+            pre.next = temp;
+        }
+
+        return ans.next;
+    }
+}
diff --git a/src/main/test/com/chen/test/TestLinkRevert.java b/src/main/test/com/chen/test/TestLinkRevert.java
@@ -0,0 +1,47 @@
+package com.chen.test;
+
+/**
+ * @author Chen WeiJie
+ * @date 2020-05-27 17:26:50
+ **/
+public class TestLinkRevert {
+
+
+    /**
+     * Definition for singly-linked list.
+     * public class ListNode {
+     * int val;
+     * ListNode next;
+     * ListNode(int x) { val = x; }
+     * }
+     */
+    public class ListNode {
+        int val;
+        ListNode next;
+
+        ListNode(int x) {
+            val = x;
+        }
+    }
+
+    class Solution {
+
+        public ListNode reverseBetween(ListNode head, int m, int n) {
+            ListNode pre = new ListNode(0);
+            ListNode ans = pre;
+            pre.next = head;
+            for (int i = 0; i < m - 1; i++) {
+                pre = pre.next;
+            }
+            ListNode end = pre.next;
+            for (int i = m; i < n; i++) {
+                ListNode tmp = end.next;
+                end.next = tmp.next;
+                tmp.next = pre.next;
+                pre.next = tmp;
+            }
+            return ans.next;
+        }
+    }
+
+}
