插入有序的单链表(要求插入后元素有序排列)

typedef struct node {
	double price;//价格
	int count;//数量
	struct node *next;
}*SLNode;

//插入函数
void Insert(SLNode head, double price, int count)
{
	SLNode p, q,r;
	p = head->next;
	q = head;
	while (p != NULL) {
		if (p->price == price) {//已存在就增加数量
			p->count += count;
			return;
		}
		else if (p->price > price) {//找到合适的插入位置
			r = (SLNode)malloc(sizeof(struct node));
			r->price = price;
			r->count = count;
			  r->next=q->next;
			q->next = r;
			return;
		}
		else if(p->price<price){
			q=p;//q始终指向p的前驱
			p = p->next;
		}
	}
	//走到这里说明，表中没有比要插入的price还要大的结点
	//直接接在链表表尾就行
	r = (SLNode)malloc(sizeof(struct node));
	r->count = count;
	r->price = price;
	r->next = NULL;
	q->next = r;
	return;
}

#pragma once
typedef struct node {
	double price;//价格
	int count;//数量
	struct node *next;
}*SLNode;
//初始化
void Initiate(SLNode *head) {
	 *head = (SLNode)malloc(sizeof(struct node));//申请头结点
	(*head)->next = NULL;
}
//插入函数
void Insert(SLNode head, double price, int count)
{
	SLNode p, q,r;
	p = head->next;
	q = head;
	while (p != NULL) {
		if (p->price == price) {//已存在就增加数量
			p->count += count;
			return;
		}
		else if (p->price > price) {//找到合适的插入位置
			r = (SLNode)malloc(sizeof(struct node));
			r->price = price;
			r->count = count;
			  r->next=q->next;
			q->next = r;
			return;
		}
		else if(p->price<price){
			q=p;//q始终指向p的前驱
			p = p->next;
		}
	}
	//走到这里说明，表中没有比要插入的price还要大的结点
	//直接接在链表表尾就行
	r = (SLNode)malloc(sizeof(struct node));
	r->count = count;
	r->price = price;
	r->next = NULL;
	q->next = r;
	return;
}
//打印链表所有结点的数据元素
void print(SLNode head)
{
	SLNode p = head->next;
	printf("价格\t\t数量\n");
	while (p != NULL)
	{
		printf("%lf\t%d\n", p->price, p->count);
		p = p->next;
	}
}
//撤销单链表的申请空间
void Destroy(SLNode head)
{
	SLNode q;
	SLNode p = head->next;
	while (p) {
		q = p;
		p = p->next;
		free(q);
	}
	head = NULL;
}

#include<stdio.h>
#include<windows.h>
#include"LNode.h"
#include<malloc.h>
#include<stdlib.h>
int main() {
	SLNode head;
	Initiate(&head);
	for (int i = 0; i < 10; i++)
	{
		Insert(head,i+1,i+2);
	}
	print(head);
	Insert(head, 10, 10);
	print(head);
	system("pause");
	return 0;
}