[LeetCode] 092: Rotate List

最新推荐文章于 2019-08-10 11:23:52 发布

1.02^365的成长裂变

最新推荐文章于 2019-08-10 11:23:52 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925245

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[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.

[Solution]

class Solution {
public:
	ListNode *rotateRight(ListNode *head, int k) {
		// Note: The Solution object is instantiated only once and is reused by each test case.

		// invalid
		if(NULL == head || k <= 0)return head;

		// get the length of the list
		int len = 0;
		ListNode* p = head;
		while(p != NULL){
			len++;
			p = p->next;
		}

		// reset k
		k %= len;
		if(k == 0)return head;

		// move k steps forward
		p = head;
		for(int i = 0; i < k; ++i){
			p = p->next;
		}

		// cut the list into two parts, and link then reversed
		ListNode *prep = p;	// the node before p;
		ListNode *q = head;	// the node two be cut
		ListNode *preq = q;	// the node before q;
		while(p != NULL){
			preq = q;
			q = q->next;
			prep = p;
			p = p->next;
		}

		// link
		preq->next = NULL;
		prep->next = head;
		head = q;

		return head;
	}
};