booklinklist.cpp

数据结构源程序

// sqlist.cpp : 定义控制台应用程序的入口点。
//

//#include "stdafx.h"
#include "stdio.h"
#include "string.h"
#include "process.h"

#define MAXSIZE 100

struct book{
   char sBookName[50];
   char sWriter[20];
   char sPress[100];
   float fPrice;
   int iTotalNum;    //总数
   int iLendNum;     //借出
   int iInventNum;   //剩余
};

typedef struct book ElemType;

struct LNode{
	ElemType elem;
	LNode *pnext;
};

typedef int status;

typedef struct LNode LNode,*LinkList;

status Init(LinkList &sl)
{
	sl = new LNode;
	sl->pnext = NULL;

	if(!sl) return 0;
	else return 1;
}

void Destroy(LinkList &sl)
{
    LNode *pa = sl->pnext,*pb;
    while(pa)
    {
         pb = pa->pnext;
         delete pa;
         pa = pb;    
    }
}
status Creat(LinkList &sl)
{

	int length; //表的长度
	ElemType elem;
    LNode *pnew;

	if(!sl) return 0;
	
	printf("\n\n输入表的长度：");
	scanf("%d",&length);

	for(int i=1;i<= length; i++)
	{
        printf("\n\n输入书名 作者 出版社 价格 总数\n");
		scanf("%s%s%s%f%d",elem.sBookName,elem.sWriter,elem.sPress,&elem.fPrice,&elem.iTotalNum);
        elem.iLendNum = 0;
		elem.iInventNum = elem.iTotalNum;
		
		pnew = new LNode;   //生成新结点
        pnew->elem = elem;
		pnew->pnext = NULL;

		pnew->pnext = sl->pnext; //插入结点
		sl->pnext = pnew;
	}

	return 1;
}

status OutPut(LinkList sl)
{
	LNode* pnew;

	if(!sl->pnext)
	{
		printf("\n\n表为空！");
		return 0;
	}

	printf("\n\n书名\t作者\t出版社\t价格\t总数\t借出\t剩余\n ");
	for(pnew = sl->pnext; pnew; pnew = pnew->pnext)
	{
		printf("\n%s\t%s\t%s\t%.2f\t%d\t%d\t%d\n",pnew->elem.sBookName,pnew->elem.sWriter,
			pnew->elem.sPress,pnew->elem.fPrice,pnew->elem.iTotalNum,pnew->elem.iLendNum,
			pnew->elem.iInventNum);
		
	}
	return 1;
}

status Insert(LinkList sl,int iPos,ElemType elem)
{
    
	LNode* pnode = sl;
	LNode* pnew;

	for(int i=0;i<iPos-1 && pnode;i++)
	{
		pnode = pnode->pnext;
	}

	if(!pnode || i>iPos-1)
	{
		printf("插入位置不正确!");
		return 0;
	}

	pnew = new LNode;
	pnew->elem = elem;
	pnew->pnext = NULL;

	pnew->pnext = pnode->pnext;
	pnode->pnext=pnew;
	

	return 1;
}

int GetLength(LinkList sl)
{
	LNode* pnode;
    int length=0;

	for(pnode = sl->pnext; pnode; pnode=pnode->pnext)
		length++;

	return length;
}

status Delete(LinkList sl,int iPos,ElemType &elem)
{
    int length;
    LNode* pnode;
	int i;
	
	if(!sl->pnext) 
	{
		printf("\n\n表空，不能删除");
		return 0;
	}
	
	length = GetLength(sl);
	
	if(iPos > length || iPos < 1)
	{
		printf("\n\n删除位置不正确！");
		return 0;
	}
	
	for(i=0,pnode=sl; i<iPos-1 && pnode; i++,pnode=pnode->pnext);

	if(pnode && pnode->pnext)
	{
		LNode* ptemp = pnode->pnext;
		
		pnode->pnext = ptemp->pnext;
		delete ptemp;
		return 1;
	}

}

status FindBook(LinkList sl,char *bname)
{
	LNode* pnode=sl->pnext;

	for(;pnode;pnode = pnode->pnext)
		if(strcmp(pnode->elem.sBookName,bname)==0)
		{
			printf("\n\n找到的书目信息\n%s\t%s\t%s\t%.2f\t%d\t%d\t%d\n",pnode->elem.sBookName,
				pnode->elem.sWriter,pnode->elem.sPress,pnode->elem.fPrice,
				pnode->elem.iTotalNum,pnode->elem.iLendNum,pnode->elem.iInventNum);
		return 1;
		}

	if(!pnode)
	{
		printf("\n\n没有该记录！");
		return 0;
	}
}

status FindWriter(LinkList sl,char *wname)
{
	int flag=0;
	LNode* pnode;

	for(pnode=sl->pnext; pnode; pnode=pnode->pnext)
	{
		if(strcmp(pnode->elem.sWriter,wname)==0)
		{
			if(flag == 0)
			{
				printf("\n\n找到该作者的书目信息\n%s\t%s\t%s\t%.2f\t%d\t%d\t%d\n",
					pnode->elem.sBookName,pnode->elem.sWriter,
				        pnode->elem.sPress,pnode->elem.fPrice,pnode->elem.iTotalNum,
						pnode->elem.iLendNum,pnode->elem.iInventNum);
				flag=1;
			}
			else 
				printf("\n\n%s\t%s\t%s\t%.2f\t%d\t%d\t%d\n",					
				         pnode->elem.sBookName,pnode->elem.sWriter,
				        pnode->elem.sPress,pnode->elem.fPrice,pnode->elem.iTotalNum,
						pnode->elem.iLendNum,pnode->elem.iInventNum);
		}
		
	}


	if(pnode)
	{
		printf("\n\n没有该记录！");
		return 0;
	}
	else return 1;
}

status LendBook(LinkList sl,char *bname)
{
	LNode* pnode;

	for(pnode=sl->pnext; pnode; pnode=pnode->pnext)
	{
		if(strcmp(pnode->elem.sBookName,bname) == 0)
		{
			if(pnode->elem.iInventNum)
			{
				pnode->elem.iInventNum--;
				pnode->elem.iLendNum++;
				return 1;
			}
			else 
			{
				printf("\n\n这本书没有库存！");
				return 0;
			}
		}
	}

	printf("\n\n对不起，没有这本书！");
	return 0;

}

status ReturnBook(LinkList sl,char *bname)
{
	LNode *pnode;

	for(pnode=sl->pnext; pnode; pnode = pnode->pnext)
	{
		if(strcmp(pnode->elem.sBookName,bname) == 0)
		{
			pnode->elem.iInventNum++;
			pnode->elem.iLendNum--;
			return 1;
		}
	}

	printf("\n\n对不起，没有这本书！");
	return 0;

}

main()
{
	char ch;
	int flag;
	LinkList sl = NULL;
	int iPos;
	ElemType elem;

	char *bname = new char[50];
	char *wname = new char[10];
	char *pname = new char[100];

	printf("\n/******书目管理系统*****/\n");
	printf("\n/******本系统基本操作如下：\n\t0：退出\n\t1：初始化\n\t2:创建\n\t3:输出\n");
	printf("\t4:插入\n\t5:删除\n\t6:按作者查找\n\t7:按书名查找\n\t8:借书\n\t9:还书\n");

	printf("\n请输入操作提示：(0~9)");

	while(1)
	{
		ch = getchar();
		switch(ch)
		{
		case '0':break;
		case '1':
			flag = Init(sl);
			if(flag) printf("\n初始化成功！");
			else printf("\n初始化失败！");
			break;
		case '2':
			flag = Creat(sl);
			if(flag) printf("\n创建成功！");
			else printf("\n创建失败！");
			break;
		case '3':
			OutPut(sl);
			break;
    	case '4':
			printf("\n输入插入位置：");
			scanf("%d",&iPos);
			printf("\n输入插入元素：书名\t作者\t出版社\t价格\t总数\n ");
			scanf("%s%s%s%f%d",elem.sBookName,elem.sWriter,elem.sPress,&elem.fPrice,&elem.iTotalNum);
			elem.iLendNum = 0;
			elem.iInventNum = elem.iTotalNum;
			flag = Insert(sl,iPos,elem);
			if(flag) printf("\n插入成功！");
			else printf("\n插入失败！");
			break;
		case '5':
			printf("\n输入删除位置：");
			scanf("%d",&iPos);
			flag = Delete(sl,iPos,elem);
			if(flag) printf("\n删除成功！");
			else printf("\n删除失败！");
			break;
		case '6':
			printf("\n输入书名：");
			scanf("%s",bname);
			flag = FindBook(sl,bname);

			break;
		case '7':
			printf("\n输入作者姓名：");
			scanf("%s",wname);
			FindWriter(sl,wname);
			break;

		case '8':
			printf("\n输入借阅书名");
			scanf("%s",bname);
			LendBook(sl,bname);
			break;

		case '9':
			printf("\n输入归还书名");
			scanf("%s",bname);
			ReturnBook(sl,bname);
			break;

		default:
			continue;
		}

	    printf("\n请输入操作提示：(0~9)");
		
		if(ch == '0')
		{
                        Destroy(sl);
			delete []bname;
			delete []wname;
			delete []pname;
	        exit(1);
		}
	}


}