Create 61. Rotate List

Author: SjxSubham

61. Rotate List

@@ -0,0 +1,30 @@
+class Solution {
+public:
+    int getLength(ListNode*head){
+        int len =0;
+        while(head){
+            ++len;
+            head= head->next;
+        }
+        return len;
+    }
+    ListNode* rotateRight(ListNode* head, int k) {
+        if(!head)return 0;
+        int len = getLength(head);
+        int actualRotateK = (k% len);
+        if(actualRotateK == 0)return head;
+        int newLastNodepos = len - actualRotateK - 1;
+    ListNode* newLastNode = head;  
+    for(int i=0;i<newLastNodepos;i++){
+        newLastNode = newLastNode->next;
+    }  
+    ListNode*newHead = newLastNode->next;
+    newLastNode->next = 0;
+    ListNode*it = newHead;
+    while(it->next){
+        it= it->next;
+    }
+    it->next = head;
+    return newHead;
+    }
+};