refactor 61

fishercoder1534 · fishercoder1534 · commit cdb9da04ba51 · 2018-01-22T07:23:51.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_61.java b/src/main/java/com/fishercoder/solutions/_61.java
@@ -13,25 +13,26 @@
  */
 public class _61 {
 
+  public static class Solution1 {
     //credit: https://discuss.leetcode.com/topic/26364/clean-java-solution-with-brief-explanation
     //link the tail of the linked list to the head to form a circle, then count to find the pint and cut it
     public ListNode rotateRight(ListNode head, int k) {
-        if (head == null) {
-            return head;
-        }
-        ListNode copyHead = head;
-        int len = 1;
-        while (copyHead.next != null) {
-            copyHead = copyHead.next;
-            len++;
-        }
-        copyHead.next = head;//link the tail and head to make it a circle
-        for (int i = len - k % len; i > 1; i--) {
-            head = head.next;
-        }
-        copyHead = head.next;
-        head.next = null;//break the circle
-        return copyHead;
+      if (head == null) {
+        return head;
+      }
+      ListNode copyHead = head;
+      int len = 1;
+      while (copyHead.next != null) {
+        copyHead = copyHead.next;
+        len++;
+      }
+      copyHead.next = head;//link the tail and head to make it a circle
+      for (int i = len - k % len; i > 1; i--) {
+        head = head.next;
+      }
+      copyHead = head.next;
+      head.next = null;//break the circle
+      return copyHead;
     }
-
+  }
 }
diff --git a/src/test/java/com/fishercoder/_61Test.java b/src/test/java/com/fishercoder/_61Test.java
@@ -7,37 +7,34 @@
 
 import static junit.framework.Assert.assertEquals;
 
-/**
- * Created by fishercoder on 4/30/17.
- */
 public class _61Test {
-    private static _61 test;
-    private static ListNode expected;
-    private static ListNode actual;
-    private static ListNode head;
-    private static int k;
+  private static _61.Solution1 solution1;
+  private static ListNode expected;
+  private static ListNode actual;
+  private static ListNode head;
+  private static int k;
 
-    @BeforeClass
-    public static void setup() {
-        test = new _61();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _61.Solution1();
+  }
 
-    @Test
-    public void test1() {
-        k = 2;
-        expected = new ListNode(4);
-        expected.next = new ListNode(5);
-        expected.next.next = new ListNode(1);
-        expected.next.next.next = new ListNode(2);
-        expected.next.next.next.next = new ListNode(3);
+  @Test
+  public void test1() {
+    k = 2;
+    expected = new ListNode(4);
+    expected.next = new ListNode(5);
+    expected.next.next = new ListNode(1);
+    expected.next.next.next = new ListNode(2);
+    expected.next.next.next.next = new ListNode(3);
 
-        head = new ListNode(1);
-        head.next = new ListNode(2);
-        head.next.next = new ListNode(3);
-        head.next.next.next = new ListNode(4);
-        head.next.next.next.next = new ListNode(5);
+    head = new ListNode(1);
+    head.next = new ListNode(2);
+    head.next.next = new ListNode(3);
+    head.next.next.next = new ListNode(4);
+    head.next.next.next.next = new ListNode(5);
 
-        actual = test.rotateRight(head, k);
-        assertEquals(expected, actual);
-    }
+    actual = solution1.rotateRight(head, k);
+    assertEquals(expected, actual);
+  }
 }
