题目链接:https://leetcode.com/problems/rotate-list/
Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL
and k = 2
,
return 4->5->1->2->3->NULL
.
代码如下:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* rotateRight(ListNode* head, int k) {
if(!head) return head;
int len = 1;
ListNode *q;
for(q = head; q->next != NULL; len++) q = q->next;
q->next = head;
for(int i = 0; i < len - k%len; i++) q = q->next;
head = q->next;
q->next = NULL;
return head;
}
};
参考:http://fisherlei.blogspot.com/2013/01/leetcode-rotate-list.html