Given a linked list, rotate the list to the right by k places, where k is non-negative.
Example 1:
Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1->2->3->NULL Explanation: rotate 1 steps to the right: 5->1->2->3->4->NULL rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:
Input: 0->1->2->NULL, k = 4 Output:2->0->1->NULL
Explanation: rotate 1 steps to the right: 2->0->1->NULL rotate 2 steps to the right: 1->2->0->NULL rotate 3 steps to the right:0->1->2->NULL
rotate 4 steps to the right:2->0->1->NULL
题解:通过定义两个链表指针,第一个链表指针比第二个链表指针领先k,当第一个链表指针到达末尾的时候,第二个链表指针所指向的下一个节点指针就是新的头指针。
/**
* 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)
return NULL;
int length = 0; //表示链表的长度
ListNode* temp = head;
while(temp != NULL)
{
temp = temp->next;
++length;
}
k = k % length;
if (k == 0)
return head;
int a = 0; //领先节点的个数
temp = head;
while (a < k)
{
temp = temp->next;
a++;
}
ListNode* node = head;
while(temp->next != NULL)
{
node = node->next;
temp = temp->next;
}
ListNode *newHead = node->next;
node->next = NULL;
temp->next = head;
head = newHead;
return head;
}
};