旋转链表【C语言】

最新推荐文章于 2024-07-18 11:11:00 发布

千疑千寻~

最新推荐文章于 2024-07-18 11:11:00 发布

阅读量106

点赞数 2

分类专栏：算法题目文章标签：链表 c语言数据结构

本文链接：https://blog.csdn.net/weixin_53161762/article/details/137611306

版权

算法题目专栏收录该内容

20 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
	int data;
	struct Node* next;
} Node, *LinkedList;

// 创建一个新节点
Node* createNode(int data) {
	Node* newNode = (Node*)malloc(sizeof(Node));
	if (newNode == NULL) {
		printf("Error! Unable to create a new node.\n");
		exit(0);
	}
	newNode->data = data;
	newNode->next = NULL;
	return newNode;
}

// 在链表末尾添加新节点
void append(LinkedList* head, int data) {
	if (*head == NULL) {
		*head = createNode(data);
	}
	else {
		Node* lastNode = *head;
		while (lastNode->next != NULL) {
			lastNode = lastNode->next;
		}
		lastNode->next = createNode(data);
	}
}

// 打印链表
void printList(LinkedList head) {
	while (head != NULL) {
		printf("%d ", head->data);
		head = head->next;
	}
	printf("\n");
}

LinkedList rotate(Node* head, int k)
{
	if (head == NULL || head->next == NULL || k == 0)
	{
		return head;
	}
	int listLength = 1;
	Node* tail = head;
	while (tail->next != NULL)
	{
		listLength = listLength + 1;   //获取链表的总长度
		tail = tail->next;
	}
	if (listLength <= k)
	{
		return head;
	}

	int i = listLength - k - 1;
	Node* newTail = head;
	Node* newHead = NULL;
	while(i != 0)
	{
	    //这个是获取新的尾部的节点，1，2，3，4，5，6，如果传进来k是2，则newTial指向4所在的节点
		newTail = newTail->next;
		i--;
	}
	newHead = newTail->next;   // 5(newHead )，6

	//进行旋转
	newTail->next = NULL;  // 将4所在的节点的next = NULL;使其成为新的尾部
	tail->next = head;     //  5(newHead )，6 -> 1(head)，2，3，4 = NULL   

	return newHead;
}

int main() {
	LinkedList head1 = NULL;
	append(&head1, 1);
	append(&head1, 2);
	append(&head1, 3);
	append(&head1, 4);
	append(&head1, 5);
	append(&head1, 6);

	printf("Original List1: ");
	printList(head1);

	LinkedList head = rotate(head1, 2);

	printf("deleteDuplicate List: ");
	printList(head);
	system("pause");
	return 0;
}

LinkedList rotate(Node* head, int k)
{
	if (head == NULL || head->next == NULL || k == 0) {
		return head;
	}

	int length = 1;
	Node* tail = head;

	// 计算链表长度并找到尾节点
	while (tail->next) {
		tail = tail->next;
		length++;
	}

	k = k % length;
	if (k == 0) {
		return head;
	}

	// 找到新的尾节点和新的头节点
	Node* new_tail = head;
	for (int i = 0; i < length - k - 1; i++) {
		new_tail = new_tail->next;
	}
	Node* new_head = new_tail->next;

	// 进行旋转
	new_tail->next = NULL;
	tail->next = head;

	return new_head;
}