SJCHEN1221的博客

算法分析：在实现模2取余后需要逆序输出，这个地方通过不断乘以10，不需要再通过数组或者逆序函数来实现。 #include <stdio.h> int Decimal(int n) { int result=0,k=1; int i; while(n){ i=n%2; result = k*i + result; k = k*10; n = n/2; } ...

#include <stdio.h> #include <stdlib.h> #define M 100 typedef int ElemType; typedef struct { ElemType data[M]; int top; }Stack; //初始化栈 void InitStack(Stack *s) { s->top = -1; } in...

#include <stdio.h> #include <stdlib.h> typedef int ElemType; typedef struct Linknode { ElemType data; struct Linknode *next; }LiStack; //初始化栈 void InitStack(LiStack* &s) { ...

#include <stdio.h> #include <stdlib.h> #define M 100 typedef int ElemType; typedef struct { ElemType data[M]; int top; }Stack; //初始化栈 void InitStack(Stack *s) { s->top = -1; } int...