数据结构代码(实验).docVIP

约瑟夫环问题： #include iostream using namespace std; typedef struct Node { int num; //编号 int Password; //密码 struct Node *next; }JosephuNode; // 使用单向循环链表创建约瑟夫环 JosephuNode *Creat_Node(int n) { int i,m; JosephuNode *head, *last; head = last = (JosephuNode *)malloc(sizeof(JosephuNode)); //申请头结点 coutendl; cout请分别输入每个人的密码：endl; for (i = 1; i n; i++) { last-num = i; cinm; last-Password=m; last-next = (JosephuNode *)malloc(sizeof(JosephuNode)); //申请一个新结点 last = last-next; //指针指向下一个结点 } last-num = i; cinm; last-Password=m; last-next = head; //将尾结点指针指向表头 return head; } // 约瑟夫环的实现 void Josephu(JosephuNode *head,int Password) { int i,j; JosephuNode *last; for (i=1; last != head; i++) { for (j=1; jPassword; j++) { last=head; head=head-next; } last-next = head-next; couthead-num ; Password=head-Password; free(head); head = last-next; } couthead-numendl; free(head); } void main() { int n, m; JosephuNode *head; cout请输入总人数n的值：; cinn; cout\n; cout请输入报数上限值m：; cinm; head=Creat_Node(n); coutendl; cout出列的顺序：endl; Josephu(head,m); } 表达式求值： #include stdio.h #include stdlib.h #include string.h #define NULL 0 #define OK 1 #define ERROR -1 #define STACK_INIT_SIZE 100 #define STACKINCREMENT 20 /* 定义字符类型栈 */ typedef struct{ int stacksize; //表达式长度 char *base; char *top; } Stack; /* 定义整型栈 */ typedef struct{ int stacksize; int *base; int *top; } Stack2; /* ----------------- 全局变量--------------- */ Stack OPTR;/* 定义运算符栈*/ Stack2 OPND; /* 定义操作数栈 */ char expr[255] = ; /* 存放表达式串 */ char *ptr = expr; int InitStack(Stack *s) //构造运算符栈 { s-base=(char *)malloc(STACK_INIT_SIZE*sizeof(char)); if(!s-base) return ERROR; //第一个字符不能为0 s-top=s-base; s-stacksize=STACK_INIT_SIZE; return OK; } int InitStack2(Stack2 *s) //构造操作数栈 { s-base=(int *)malloc(STACK_INIT_SIZE*sizeof(int)); if(!s-base) return ERROR