1.22作业

作业要求：

程序代码：

head.h:

#ifndef __HEAD_H__
#define __HEAD_H__
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#endif
//定义商品信息：商品名称，商品单价，商品购买个数，商品描述
typedef struct goods
{
	char name[10];
	float price;
	int num;
	char describe[10];
}goods_t;

goods_t *create(int n);
void input (goods_t *p, int n);
void bubble(goods_t *p,int n);
char* Max(goods_t *p,int n);
float Money(goods_t *p,int n);
void output(goods_t *p);
goods_t *free_space(goods_t *p);

test.c

#include "head.h"
//申请内存
goods_t *create(int n)
{
	goods_t *p=(goods_t *)malloc(sizeof(goods_t)*n);
	if(NULL==p)
		return NULL;
	return p;		
}

//循环输入
void input(goods_t *p,int n)
{
	for(int i=0;i<n;i++)
	{
		scanf("%s",(p+i)->name);
		scanf("%f",&(p+i)->price);
		scanf("%d",&(p+i)->num);
		scanf("%s",(p+i)->describe);
	}
}

//排序
void bubble(goods_t *p,int n)
{
	for(int i=1;i<n;i++)
	{
		for(int j=0;j<n-i;j++)
		{
			if((p+j)->price>(p+j+1)->price)
			{
				goods_t t=*(p+j);
				*(p+j)=*(p+j+1);
				*(p+j+1)=t;
			}
		}
	}
}


//计算最贵的商品
char *Max(goods_t *p,int n)
{
	float max=p->price;
	int maxi=0;
	for(int i=0;i<n;i++)
	{
		if(max<(p+i)->price)
		{
			max=(p+i)->price;
			maxi=i;
		}
	}
	return (p+maxi)->name;
}

//计算共花了多少钱
float Money(goods_t *p,int n)
{
	float sum=0;
	for(int i=0;i<n;i++)
	{
		sum+=(p+i)->price*(p+i)->num;
	}
	return sum;
}

//循环输出
void output(goods_t *p)
{
	for(int i=0;i<5;i++)
	{
		printf("%s\t",(p+i)->name);
		printf("%.2f\t",(p+i)->price);
		printf("%d\t",(p+i)->num);
		printf("%s\n",(p+i)->describe);
	}
}
//释放内存
goods_t *free_space(goods_t *p)
{
	if(NULL==p)
		return NULL;
	free(p);
	p=NULL;
	return p;
}

main.c:

#include "head.h"
int main(int argc, const char *argv[])
{
	int n=5;
	goods_t *p=create(n);
	input(p,n);
	bubble(p,n);
	char *name=Max(p,n);
	printf("max name=%s\n",name);
	float money=Money(p,n);
	printf("money=%.2f\n",money);
	output(p);
	p=free_space(p);
	return 0;
}

运行结果：

课程总结：