软件技术基础_6学时(学生用程序).docVIP

《软件技术基础》课程实验教学课程实验教学大纲课、 实验目的： 课后撰写实验报告。#include stdio.h typedef struct node { int data; struct node *next; }lklist; lklist *creat(void) { lklist *p,*q,*head; int i=0; p=q=(lklist *)malloc(sizeof(lklist)); printf(\ncreate :input data,0--end\n); scanf(%d,p-data); head=NULL; while(p-data!=0) { i++; if(i==1)head=p; else q-next=p; q=p; /*******found1*********/ p=(lklist*)malloc(sizeof(lklist)); scanf(“%d”,p-data); /*******found*********/ } q-next=NULL; return(head); } void display(lklist *L) { lklist *p,*q; p=L; printf(\n); while(p!=NULL) {printf(“%d”,p-data); p=p-next; /*******found2*********/ /*******found*********/ } } void locate(lklist *L, int x) { lklist *p,*q; int i=1; p=L; while(p-next!=NULL) { if(p-data==x) { printf(\nfound!Its position is %d,i); return; } else /*******found3*********/ {p=p-next; i++; } /*******found*********/ } if(p-data!= x) printf(no this node!); } lklist *insert(lklist *L,int x,int i) { lklist *p,*q;int j; p=L; q=(lklist *)malloc(sizeof(lklist)); q-data = x; if(i0) printf(error,try again!); if(i= =1) { q-next=L; L=q; return L; } j=1; while((ji-1) (p-next!=NULL)) { j++; p=p-next; } if(j= =i-1) { /*******found4*********/ q-next=p-next; p-next=q; return(L); /*******found*********/ } else { printf(error!); return L; } } lklist *delete(lklist *L,int i) { lklist *p,*q; int j=1; p=L; if(i= =1) { q=L; L=L-next; free(q); return L; } while(p-nextji-1) { p=p-next; ++j; } if(!(p-next)||ji) return L; /*******found5*********/ /*******found*********/ return L; } main() { lklist *L; int data,loc,i; printf(\n1--insert 2--delete 3--locate\n); printf(please input:); scanf(%d,i); switch(i) { case 1:L=creat(); printf(insert:input data and postion:); scanf(%d,%d,data,loc); L=insert(L,data,loc); display(L); break; case 2:L=creat(); printf(delete data:input position:); scanf(%d,loc); L=delete(L,loc); display(L); break; case 3:L=creat(); p