以下关于栈和队列的代码,执行后输出是:
stack<int> s; queue<int> q;
for (int i = 1; i <= 3; ++i) { s.push(i); q.push(i); }
cout << s.top() << " " << q.front() << endl;
- A. 1 3
- B. 3 1
- C. 3 3
- D. 1 1
正确答案:B
stack<int> s; queue<int> q;
for (int i = 1; i <= 3; ++i) { s.push(i); q.push(i); }
cout << s.top() << " " << q.front() << endl;
正确答案:B
想系统刷完 GESP C++ 1~8 级真题,并查看每道题的逐题精讲?
进入 GESPPASS 开始练习