摘要:voidPush(Stack*S,inttheData){//将数据theData压栈List*newNode;newNode=(List*)calloc(1,sizeof(List));newNode->data=theData;newNode->next=S->pTop;S->pTop=(3);}voidPop(Stack*S){//弹栈List*lastTop;if(IsEmpty(S))return;lastTop=S-
void Push(Stack* S, int theData) {//将数据theData压栈
List* newNode;
newNode = (List*)calloc(1, sizeof(List));
newNode->data = theData;
newNode->next = S->pTop;
S->pTop = (3) ;
}
void Pop(Stack* S) {//弹栈
List* lastTop;
if( IsEmpty(S) ) return;
lastTop = S->pTop;
S->pTop = (4) ;
free(lastTop);
}
#define MD(a) a<<2
int main(){
int i;
Stack* myStack;
myStack = NewStack();
Push(myStack, MD(1));
Push(myStack, MD(2));
Pop(myStack);
Push(myStack, MD(3)+1);
while( !IsEmpty(myStack) ){
printf("%d ", Top(myStack));
Pop(myStack);
}
return 0;
}
以上程序运行时的输出结果为: (5)
试题六(共15分)
阅读下列说明和C++代码,将应填入 (n) 处的字句写在答题纸的对应栏内。
软考备考资料免费领取
去领取