Problem:
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
.
Code:(LeetCode运行15ms)
/**
* 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 == NULL || k == 0) {
return head;
}
ListNode *position = head;
int size = 1;
while (true) {
if (position -> next == NULL) {
position -> next = head; //连成环
break;
} else {
position = position -> next;
size++; //计算长度
}
}
k = size - k % size; //右边k个,等于从左开始数的size - k个。但是有可能size == k,这种情况一样需要翻转,所以用k%size就可以解决。
position = head;
for (int i = 0; i < k - 1; i++, position = position -> next);
head = position -> next; //重新选择头结点
position -> next = NULL; //断开环
return head;
}
};