#include <stdio.h>
#include <stdlib.h>
typedef struct node{
int date;
struct node* pre;
struct node* next;
}node,*pnode;
void insert(pnode list,int date){
//尾插法
pnode p = list;
if(p==NULL){
return;
}
else{
while(p->next){
p = p -> next;
}
pnode pnew=(pnode)malloc(sizeof(node));
pnew -> date = date;
p -> next = pnew;
pnew-> pre =p;
pnew -> next = NULL;
}
}
void xiaoshu(pnode list,int n){
//输出想要的n位PI的函数
pnode p = list;
p=p->next;
printf("%d.",p->date);
int i;
p=p->next;
for(i=0;i<n;i++){
printf("%d",p->date);
if(p->next){
p=p->next;
}
西工大数据结构实验第一题
最新推荐文章于 2024-05-22 10:59:33 发布