1 Star 0 Fork 2

jackee/数据结构项目ofo-shared-bicycle

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
Ds Ofo Project.cpp 13.04 KB
一键复制 编辑 原始数据 按行查看 历史
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600
#include <iostream>
#include <algorithm>
#include <windows.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define NAME 20
#define TIME 20
const int st_num=100;
int cu_num=100;
int count = 0;
int count1 = 0;
typedef struct bike
{
int b_num;
char b_time[TIME];
char r_time[TIME];
char username[NAME];
bool info=false;
struct bike *next;
} BIKE,*LinkList,*LinkStack;
BIKE Bike[st_num];
void Push(LinkStack &top,int bnum,char user[],char btime[],char rtime[])
{
LinkStack p;
p=new bike();
p->b_num=bnum;
strcpy(p->username,user);
strcpy(p->b_time,btime);
strcpy(p->r_time,rtime);
p->next=top;
top=p;
}
void Pop(LinkStack &top)
{
LinkStack p;
p=top;
top=p->next;
free(p);
}
void Init(LinkStack &s)
{
s=NULL;
}
void Printinfo(LinkStack p)
{
while(p)
{
printf("%d\t\t%s\t\t%s\t\t%s\n",p->b_num,p->username,p->b_time,p->r_time);
p=p->next;
}
}
LinkList Initlist(LinkList l)
{
LinkList p = (LinkList)malloc(sizeof(BIKE));
p->next = NULL;
l = p;
return l;
}
LinkList inputdata(LinkList l)
{
int i;
LinkList p = (LinkList)malloc(sizeof(BIKE));
printf("请输入单车序号:");
scanf("%d",&i);
if(!p->info)
{
p->b_num=i;
Bike[i].b_num=i;
cu_num--;
p->info=true;
Bike[i].info=true;
}
printf("请输入借车者姓名:");
scanf("%s",p->username);
strcpy(Bike[i].username,p->username);
printf("请输入借车时间:");
scanf("%s",p->b_time);
strcpy(Bike[i].b_time,p->b_time);
printf("请输入还车时间:");
scanf("%s",p->r_time);
strcpy(Bike[i].r_time,p->r_time);
p->next = l->next;
l->next = p;
printf("输入已完成\n");
count1++;
return l;
}
void outputdata(int b_num,char username[],char b_time[],char r_time[])
{
LinkStack s;
Init(s);
Push(s,b_num,username,b_time,r_time);
Printinfo(s);
}
void ShowAll(LinkList l)
{
LinkList p = l->next;
printf("单车序号\t借车者姓名\t借车时间\t还车时间\n");
while(p)
{
outputdata(p->b_num,p->username,p->b_time,p->r_time);
p = p->next;
}
printf("\n输出已完成\n");
}
void menu()
{
printf("\t\t\t 欢迎来到OFO借车系统\n");
for(int i=0; i<20; i++)
cout<<" ";
for(int i=0; i<40; i++)
cout<<"*";
cout<<endl;
printf("\t\t1.请输入单车序号,借车者姓名,借车时间,还车时间\t\t\n");
printf("\t\t\t\t2.车辆信息显示\t\t\n");
printf("\t\t\t\t3.借车信息显示\t\t\n");
printf("\t\t\t\t4.按单车号查询\t\t\n");
printf("\t\t\t\t5.按借车时间查询\t\n");
printf("\t\t\t\t6.按还车时间查询\t\n");
printf("\t\t\t\t7.按借用者查询\t\t\n");
printf("\t\t\t\t8.将借车信息录入文件\t\t\n");
printf("\t\t\t\t9.从文件中读取借车信息\t\t\n");
printf("\t\t\t\t10.插入借车信息\t\t\n");
printf("\t\t\t\t11.删除借车信息\t\t\n");
printf("\t\t\t\t12.修改借车信息\t\t\n");
printf("\t\t\t\t13.按借车时间排序\t\t\n");
printf("\t\t\t\t14.退出借车系统\t\t\n");
for(int i=0; i<20; i++)
cout<<" ";
for(int i=0; i<40; i++)
cout<<"*";
cout<<endl;
}
void print_bike_num()
{
int count=0;
for(int i=1; i<=st_num; i++)
if(!Bike[i].info)
{
count++;
printf("%d ",i);
if(!(count%10))
cout<<endl;
}
}
int print_num()
{
return cu_num;
}
int erfen(int *a,int l,int r,int v)
{
int mid;
while(l<=r)
{
mid=l+r;
mid/=2;
if(a[mid]==v)
return mid;
else if(a[mid]>v)
r=mid-1;
else l=mid+1;
}
return -1;
}
void search_num(LinkList l)
{
LinkList p = l->next;
int num;
int flag=0;
printf("请输入要查找的单车序号:");
scanf("%d",&num);
while(p)
{
if(num==p->b_num)
{
flag=1;
printf("单车序号\t借车者姓名\t借车时间\t还车时间\n");
outputdata(p->b_num,p->username,p->b_time,p->r_time);
printf("\n");
break;
}
p=p->next;
}
if(!flag)
{
printf("没有您要查询的单车\n");
}
}
void search_btime(LinkList l)
{
char btime[20];
int flag=0;
LinkList p = l->next;
printf("请输入要查找的借车时间:");
scanf("%s",btime);
while(p)
{
if(!strcmp(btime,p->b_time))
{
flag=1;
printf("单车序号\t借车者姓名\t借车时间\t还车时间\n");
outputdata(p->b_num,p->username,p->b_time,p->r_time);
printf("\n");
break;
}
p=p->next;
}
if(!flag)
{
printf("没有您要查询的单车\n");
}
}
void search_rtime(LinkList l)
{
char rtime[20];
int flag=0;
LinkList p = l->next;
printf("请输入要查找的还车时间:");
scanf("%s",rtime);
while(p)
{
if(!strcmp(rtime,p->r_time))
{
flag=1;
printf("单车序号\t借车者姓名\t借车时间\t还车时间\n");
outputdata(p->b_num,p->username,p->b_time,p->r_time);
printf("\n");
break;
}
p=p->next;
}
if(!flag)
{
printf("没有您要查询的单车\n");
}
}
void search_username(LinkList l)
{
char user[20];
int flag=0;
LinkList p = l->next;
printf("请输入要查找的借车者姓名:");
scanf("%s",user);
while(p)
{
if(!strcmp(user,p->username))
{
flag=1;
printf("单车序号\t借车者姓名\t借车时间\t还车时间\n");
outputdata(p->b_num,p->username,p->b_time,p->r_time);
printf("\n");
break;
}
p=p->next;
}
if(!flag)
{
printf("没有您要查询的单车\n");
}
}
void swapchar(char *a,char *b)
{
char tmp[20];
strcpy(tmp,a);
strcpy(a,b);
strcpy(b,tmp);
}
void swapint(int *a,int *b)
{
int tmp;
tmp=*a;
*a=*b;
*b=tmp;
}
LinkList FromFile(LinkList l)
{
FILE *fp;
LinkList p;
char m[100];
char n[100];
int num;
int i = 0;
if((fp = fopen("D://bikeinfo.txt","r")) == NULL)
{
printf("文件无法打开!\n");
return l;
}
while((fscanf(fp,"%s %s",m,n)) != EOF)
{
p = (LinkList)malloc(sizeof(BIKE));
fscanf(fp,"%s %d",m,&num);
p->b_num = num;
fscanf(fp,"%s %s",m,n);
strcpy(p->username,n);
fscanf(fp,"%s %s",m,n);
strcpy(p->b_time,n);
fscanf(fp,"%s %s",m,n);
strcpy(p->r_time,n);
p->next = l->next;
l->next = p;
i++;
}
fclose(fp);
if(i == 0)
{
printf("文件为空!\n");
return l;
}
else
{
printf("读取完成!\n");
count1+=i;
return l;
}
}
void ToFile(LinkList l)
{
FILE *fp;
LinkList p = l->next;
if((fp = fopen("D://bikeinfo.txt","a+")) == NULL)
{
printf("数据文件无法打开!\n");
return;
}
if(p == NULL)
{
printf("链表为空!\n");
return;
}
printf("开始录入数据文件...\n");
while(p)
{
fprintf(fp,"%s %d\n","单车编号",p->b_num);
fprintf(fp,"%s %s\n","使用者",p->username);
fprintf(fp,"%s %s\n","借车时间",p->b_time);
fprintf(fp,"%s %s\n","还车时间",p->r_time);
p = p->next;
}
printf("录入数据完成!\n");
fclose(fp);
}
LinkList sort_btime(LinkList l)
{
int k=0,m=0;
int a[105]= {0};
for(int i=1; i<=st_num; i++)
for(int j=i+1; j<=st_num; j++)
if(Bike[j].info&&strcmp(Bike[j].b_time,Bike[j+1].b_time)<0)
{
swapint(&Bike[j].b_num,&Bike[j+1].b_num);
swapchar(Bike[j].username,Bike[j+1].username);
swapchar(Bike[j].b_time,Bike[j+1].b_time);
swapchar(Bike[j].r_time,Bike[j+1].r_time);
}
for(int i=1; i<=st_num; i++)
if(Bike[i].info)
a[k++]=i;
LinkList p;
p = l->next;
while(p&&m<=k)
{
p->b_num=Bike[a[m]].b_num;
strcpy(p->username,Bike[a[m]].username);
strcpy(p->b_time,Bike[a[m]].b_time);
strcpy(p->r_time,Bike[a[m]].r_time);
p = p->next;
m++;
}
printf("按借车时间排序完成!\n");
return l;
}
LinkList FindNode(int n,LinkList l)
{
int i;
int flag = 0;
LinkList p = l;
for(i=0 ; i<n ; i++)
{
p = p->next;
}
return p;
}
LinkList Insert(LinkList l)
{
int n;
LinkList p = (LinkList)malloc(sizeof(BIKE));
LinkList m;
printf("请输入插入数据的位置:\n");
scanf("%d",&n);
if(n > count1||n<0)
{
printf("超出规定范围!\n");
return l;
}
m = FindNode(n,l);
printf("请输入单车编号:\n");
scanf("%d",&p->b_num);
printf("请输入借主姓名\n");
scanf("%s",p->username);
printf("请输入借车时间\n");
scanf("%s",p->b_time);
printf("请输入还车时间\n");
scanf("%s",p->r_time);
p->next = m->next;
m->next = p;
printf("插入数据完成!\n");
count1++;
return l;
}
LinkList Remove(LinkList l)
{
int n;
printf("请输入移除数据的位置:\n");
scanf("%d",&n);
if(n > count1||n<0)
{
printf("超出规定范围!\n");
return l;
}
LinkList m = FindNode(n,l);
LinkList p = FindNode(n-1,l);
p->next = m->next;
free(m);
printf("删除数据完成!\n");
count1--;
return l;
}
LinkList Change(LinkList l)
{
int n,x;
int c_num;
char c_name[20],c_btime[20],c_rtime[20],c_info[20];
LinkList m;
printf("请输入修改数据的位置:\n");
scanf("%d",&n);
if(n > count1||n<0)
{
printf("超出规定范围!\n");
return l;
}
m = FindNode(n,l);
printf("请输入要修改的数据编号(1.单车编号 2.借主姓名 3.借车时间 4.还车时间:\n");
scanf("%d",&x);
switch(x)
{
case 1:
printf("请输入更改后的单车编号:\n");
scanf("%d",&c_num);
m->b_num=c_num;
break;
case 2:
printf("请输入更改后的借主姓名\n");
scanf("%s",c_name);
strcpy(m->username,c_name);
break;
case 3:
printf("请输入更改后的借车时间\n");
scanf("%s",c_btime);
strcpy(m->b_time,c_btime);
break;
case 4:
printf("请输入更改后的还车时间\n");
scanf("%s",c_rtime);
strcpy(m->r_time,c_rtime);
break;
}
printf("修改数据完成!\n");
return l;
}
void FreeNode(LinkList node)
{
LinkList tail;
while(node)
{
tail = node->next;
free(node);
node = tail;
}
}
int main()
{
int choice_num;
LinkList head;
LinkList a;
int i;
head = Initlist(head);
LinkList tail;
while(1)
{
menu();
cout<<"请选择你的操作序号:"<<endl;
cin>>choice_num;
switch(choice_num)
{
case 1:
printf("请输入单车序号,借车者姓名,借车时间,还车时间:\n");
head=inputdata(head);
break;
case 2:
printf("您还有%d辆单车可以选择:\n",print_num());
print_bike_num();
break;
case 3:
printf("借车信息显示:\n");
ShowAll(head);
break;
case 4:
printf("请输入单车号查询:\n");
search_num(head);
break;
case 5:
printf("请输入借车时间查询:\n");
search_btime(head);
break;
case 6:
printf("请输入还车时间查询:\n");
search_rtime(head);
break;
case 7:
printf("请输入借用者姓名查询:\n");
search_username(head);
break;
case 8:
printf("请将借车信息录入文件:\n");
ToFile(head);
break;
case 9:
printf("请从文件中读取借车信息:\n");
head = FromFile(head);
break;
case 10:
printf("请插入借车信息:\n");
head=Insert(head);
break;
case 11:
printf("请删除借车信息:\n");
head=Remove(head);
break;
case 12:
printf("请修改借车信息:\n");
head=Change(head);
break;
case 13:
printf("根据借车时间排序借车情况并显示:\n");
a = head;
head = sort_btime(head);
ShowAll(head);
while(a)
{
tail = a->next;
free(a);
a = tail;
}
break;
case 14:
printf("您已退出借车系统,再见!\n");
exit(0);
default:
printf("您输入有误,请重新输入正确的操作序号\n");
}
getchar();
getchar();
system("cls");
}
return 0;
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C++
1
https://gitee.com/jackee645467620/29DCH1.git
git@gitee.com:jackee645467620/29DCH1.git
jackee645467620
29DCH1
数据结构项目ofo-shared-bicycle
master

搜索帮助