refactor 25

fishercoder1534 · fishercoder1534 · commit ccbd0d53e950 · 2020-04-27T07:34:20.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_25.java b/src/main/java/com/fishercoder/solutions/_25.java
@@ -2,23 +2,6 @@
 
 import com.fishercoder.common.classes.ListNode;
 
-/**
- * 25. Reverse Nodes in k-Group
- *
- * Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
- * k is a positive integer and is less than or equal to the length of the linked list.
- * If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
- * You may not alter the values in the nodes, only nodes itself may be changed.
- * Only constant memory is allowed.
-
- For example,
- Given this linked list: 1->2->3->4->5
-
- For k = 2, you should return: 2->1->4->3->5
-
- For k = 3, you should return: 3->2->1->4->5
- */
-
 public class _25 {
 
     /**We use recursion to go all the way until the end: when the number of nodes are smaller than k;
