编写程序实现将数据值最小的放单链表最前面_编写程序实现将数据域最小的元素放置在单链表的最前面-CSDN博客

本文链接：https://blog.csdn.net/m0_61963095/article/details/125772505

本文介绍了如何使用C++定义链表结构，并通过`init`和`creatlist`函数创建和输入节点数据。核心部分展示了如何找到并输出链表中的最小值节点，最后展示了`output`函数用于遍历整个链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
typedef struct Node {
	int data;
	struct Node* node;
}Node;
Node* init(Node*first) {
	first = (Node*)malloc(sizeof(Node));
	first->node = NULL;
	return first;
}
void creatlist(Node* first) {
	Node* p;
	int j = 0, i = 1;
	while (i) {
		scanf_s("%d", &j);
		if (j != -1) {
			p = (Node*)malloc(sizeof(Node));
			p->data = j;
			p->node = first->node;
			first->node = p;

		}
		else {
			i = 0;
		}
	}

}
void min(Node* first) {
	int temp = first->node->data;
	Node* p = first->node, * q = first->node;
	p = p->node;
	while (p->node!=NULL) {
		if (temp > p->data) {
			temp = p->data;
			p = p->node;
		}
		else
			p = p->node;
	}
	if (p->node ==NULL) {
		if (temp > p->data)
			temp = p->data;

	}
	while (q->node != NULL) {
		if (q->data != temp) {
			p = q;
			q = q->node;
		}
	}
	printf("%d", q->data);
	p->node = q->node;
	q->node = first->node;
	first->node = q;

}
void output(Node* first) {
	Node* p = first;
	while (p->node!=NULL) {
		printf("%d", p->node->data);
		p = p->node;
	}
}
int main() {
	Node* first = (Node*)malloc(sizeof(Node));
	first->node = NULL;
	if (first == 0)
		printf("yes");
	creatlist(first);
	min(first);
	output(first);
	return 0;
}