作业
文章平均质量分 80
andyyang0212
这个作者很懒,什么都没留下…
展开
-
利用stack计算后缀表达式
#include #include #include struct stack{ int capacity; int topofstack; double *a; }; struct stack *createstack(int n){ struct stack *s; s = (struct stack *)malloc(sizeof(struct stack)); if(s =原创 2014-10-02 22:11:11 · 428 阅读 · 0 评论 -
DS Bonus 2: QQ Account Management
题目要求 You are supposed to implement the functions of account"Log in" and "Register" for the most popular instantmessager QQ. The most challenging partis that QQ now has more than a billion users.原创 2014-11-22 19:34:48 · 520 阅读 · 0 评论