简述以下算法的功能(栈的元素类型为int)。 Status ex1(Stack &S) { int i, n, A [255]; n=0; while (!StackEmpty(S) ) { n++; Pop(S, A[n]); }; for ( i=1; i<= n ; i++) Push(S, A[i]); }
【简答题】听力原文:Woman: Good morning. May I see your ticket, please? Man: Well, I told your office that I would pick the ticket up here. Woman: What's your name, then? Man: Mr. Pitt, that's P-I-T-T. Woman: Oh yes...