用c语言将该链表中数据域值最大的那个点移到链表的最后面
时间: 2023-05-20 09:03:56 浏览: 76
好的,这是一个比较基础的链表操作,可以通过遍历链表找到数据域值最大的节点,然后将其移动到链表末尾。以下是示例代码:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node* next;
} Node;
void moveMaxNodeToEnd(Node** head) {
if (*head == NULL) {
return;
}
Node* maxNode = *head;
Node* prev = NULL;
Node* curr = *head;
while (curr != NULL) {
if (curr->data > maxNode->data) {
maxNode = curr;
}
prev = curr;
curr = curr->next;
}
if (maxNode == *head) {
*head = (*head)->next;
} else {
prev->next = maxNode->next;
}
maxNode->next = NULL;
prev = *head;
while (prev->next != NULL) {
prev = prev->next;
}
prev->next = maxNode;
}
int main() {
Node* head = NULL;
Node* node1 = (Node*)malloc(sizeof(Node));
node1->data = 1;
Node* node2 = (Node*)malloc(sizeof(Node));
node2->data = 3;
Node* node3 = (Node*)malloc(sizeof(Node));
node3->data = 2;
node1->next = node2;
node2->next = node3;
node3->next = NULL;
head = node1;
moveMaxNodeToEnd(&head);
Node* curr = head;
while (curr != NULL) {
printf("%d ", curr->data);
curr = curr->next;
}
return 0;
}
```
这段代码实现了一个简单的链表,其中包含了三个节点,数据域分别为1、3、2。然后调用了moveMaxNodeToEnd函数,将数据域值最大的节点移动到了链表末尾。最后遍历链表并输出节点的数据域,结果为1 2 3。