LeetCode Rotate List

最新推荐文章于 2020-07-20 10:24:13 发布

kassical

最新推荐文章于 2020-07-20 10:24:13 发布

阅读量584

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kassical/article/details/38948375

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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.

class Solution {
public:
	ListNode *rotateRight(ListNode *head, int k) {
		if (head == NULL || head->next == NULL || k == 0)
			return head;

		ListNode *pbeforeslow = head;
		ListNode *pslow = head;
		ListNode *pfast = head;
		
		int i = 1;
		for (; i < k; ++i) {
			if (pfast->next == NULL)
				break;
			pfast = pfast->next;
		}

		if (i == k) {
			if (pfast->next == NULL)
				return head;

			while (pfast->next != NULL) {
				pbeforeslow = pslow;
				pslow = pslow->next;
				pfast = pfast->next;
			}

			pfast->next = head;
			pbeforeslow->next = NULL;
			return pslow;
		}
		else {
			int len = i - k % i;
			pfast->next = head; 
			for (int j = 0; j < len; ++j) {
				pfast = pfast->next;
			}
			head = pfast->next;
			pfast->next = NULL;
			return head;
		}

	}
};

class Solution {
public:
	ListNode *rotateRight(ListNode *head, int k) {
		if (head == NULL || head->next == NULL || k == 0)
			return head;

		ListNode *pfast = head;
		int count = 1;
		
		while (pfast->next != NULL) {
			pfast = pfast->next;
			++count;
		}

		pfast->next = head;
		int len = count - k % count;

		for (int i = 0; i < len; ++i) {
			pfast = pfast->next;
		}

		head = pfast->next;
		pfast->next = NULL;

		return head;
	}
};