Time: 11 ms (34.00%), Space: 11.7 MB (63.68%) - LeetHub

Author: yashcode77

0061-rotate-list/0061-rotate-list.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    int length(ListNode* head){
+        ListNode* temp=head;
+        int i = 0;
+        while(temp){
+            temp=temp->next;
+            i++;
+        }
+        return i;
+    }
+    ListNode* rotateRight(ListNode* head, int k) {
+        if(head==NULL) return NULL;
+        int len=length(head);
+        int actualk=k%len;
+        if(actualk==0) return head;
+
+        int pos=len-actualk-1;
+        ListNode* newlast=head;
+        ListNode* newhead=nullptr;
+        while(pos--){
+            newlast=newlast->next;
+        }
+        newhead=newlast->next;
+        newlast->next=NULL;
+        ListNode* it=newhead;
+        while(it->next!=NULL){
+            it=it->next;
+        }
+        it->next=head;
+        return newhead;
+        }
+};