Shadow

应用栈先进后出的原则完成十进制转换成二进制代码：        #include #include typedef struct node{ int data; struct node *next;}Stack;void StackInit(Stack *top){ top->next=NULL;}int Push(Stack *p,int x){

整理一下链表的创建、查找节点、插入节点、删除节点。。。做了一个应用实例代码：#include #include #include typedef struct node{ char data; struct node *next;}LinkList;LinkList* LinkListCreat(){ char ch; LinkList

代码：#include#includetypedef char ElemType;typedef struct DNode{ ElemType data; struct DNode *prior; struct DNode *next;}DLinkList;//初始化void InitList(DLinkList * &L){ L=(DLinkList *)mallo

代码：#include#include#define MaxSize 100void main(){ char exp[MaxSize]="{(1+2)+(3+4)+[2.5]}"; int size=strlen(exp); int counter1=0,counter2=0,counter3=0,i=0; while(i=0 &&counter2>=0 &&counter3>

题目描述：假设表达式中允许包含三种括号：圆括号、方括号和大括号。编写一个算法判断表达式中的括号是否正确匹配。代码：#include#include#include#define MaxSize 100typedef char ElemType;typedef struct { ElemType data[MaxSize]; int top;}SqStack;//初始化栈

代码：#include#include#define MaxSize 5typedef char ElemType;typedef struct{ ElemType data[MaxSize]; int front,rear;}SqQueue;//初始化void InitQueue(SqQueue *&q){ q=(SqQueue *)malloc(sizeof(Sq