0061_Rotate_List.java

Author: Daksh7112003

0061_Rotate_List.java

@@ -0,0 +1,42 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode rotateRight(ListNode head, int k) {
+        if (head == null || head.next == null || k == 0) {
+            return head;
+        }
+
+        // Find the length of the linked list
+        int len = 1;
+        ListNode tail = head;
+        while (tail.next != null) {
+            len++;
+            tail = tail.next;
+        }
+
+        // Make it a circular linked list
+        tail.next = head;
+
+        // Find the new head and break the cycle
+        k = k % len;
+        int gap = len - k;
+        ListNode newTail = head;
+
+        while (--gap > 0) {
+            newTail = newTail.next;
+        }
+
+        ListNode newHead = newTail.next;
+        newTail.next = null;
+
+        return newHead;
+    }
+}