实验三栈的操作与应用..docx

南京信息工程大学实验(实习)报告实验（实习）名称栈的操作与应用实验日期2012/11/16得分指导教师吴婷婷系计算机与软件学院专业网络工程年级2011班次1姓名管超学号20111346032栈的操作与应用实验目的掌握栈的顺序、链接存储表示及实现。实验准备奔腾2计算机或以上机型Microsoft Visual C++ 6.0实验内容二选一：利用栈实现一个十进制转换为二进制数和十六进制数利用栈实现表达式的值。（表达式自己输入，以 # 结尾）实验代码实验内容（2）的代码附在电子稿中以下代码为实验内容(1)代码#includestdio.h#includeconio.h#includestdlib.h//此实验中, 堆栈的实现是用单链表构造的typedefstruct node{short data;struct node *next;}Stack;//初始化堆栈Stack* Init(Stack S){Stack *head = (Stack *)malloc(sizeof(Stack));if (head == NULL){printf( 初始化失败!\n);exit(0);}else{head-next = NULL;return head;}}//压栈操作void Push(Stack *head, short elem){Stack *ptr = (Stack *)malloc(sizeof(Stack));if (ptr == NULL){printf( 压栈操作失败!\n);exit(0);}else{ptr-data = elem;ptr-next = NULL;}ptr-next = head-next;head-next = ptr;}//出栈操作//返回的布尔值用于判断堆栈是否为空bool Pop(Stack *head, short elem){Stack *current;current = head-next;if (current == NULL){free(head);return false;}else{elem = current-data;head-next = current-next;free(current);return true;}}//进制转换void Convert(Stack *head, unsigned long elem, short scale){unsigned long temp = elem;while (temp){Push(head, temp%scale);temp /= scale;}}//进制转换后显示void Display(Stack *head, short scale){short temp;printf(\n 转换后: );switch (scale){case 2:case 8:while (Pop(head, temp)){printf(%d, temp);}printf(\n);break;case 16:while (Pop(head, temp)){if (temp10){printf(%d, temp);}else{printf(%c, temp+55);}}printf(\n);break;default:break;}}int main(){unsigned long number;char choice;Stack S;Stack *head;while (true){printf(\n****** 进制转换 ******\n);printf(----------------------\n);printf( 1.十进制 -- 二进制\n);printf( 2.十进制 -- 八进制\n);printf( 3.十进制 -- 十六进制\n);printf( 4.退出\n);printf(----------------------\n);printf( 请选择相应的序号: );choice = getche();while (choice1 || choice4){printf(\n 输入错误, 请重新输入: );choice = getche();}if (choice == 4){printf(\n\n);system(PAUSE);return 0;}else{head = Init(S);printf(\n\n 请输入将要转化的数字: );scanf(%d, number);switch (choice){case 1:Convert(head, number, 2);Display(head, 2);break;case 2:Convert(head, number, 8);Display(head, 8);break;ca