LeetCode 61 旋转链表

旋转链表

/**
 * 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* node = head;
	int len = 0;
	ListNode* tail = NULL;
	while (node != NULL)
	{
		++len;
		tail = node;
		node = node->next;
	}

	//获得了长度那么我们取模
	k = k%len;//取模之后的数值，这样防止反复旋转

	ListNode* newhead = new ListNode(-1);
	ListNode* pre = NULL;
	newhead->next = head;
	node = head;
	int xianzai = len - k;
	while (xianzai)
	{
		pre = node;
		node = node->next;
		--xianzai;
	}
	
	
	if (node!=NULL)
	{
		//ListNode* nownode = node;
		//node->next = NULL;
		newhead->next = node;
		tail->next = head;
		pre->next = NULL;
	}
	return newhead->next;
}

};