题解 | #句子逆序#
句子逆序
https://www.nowcoder.com/practice/48b3cb4e3c694d9da5526e6255bb73c3
先进后出——栈
#include <iostream>
#include <string>
#include <stack>
int main(int argc, char* argv[]){
std::string word;
std::stack<std::string> stk;
while(std::cin >> word){
stk.push(word);
}
while(!stk.empty()){
std::cout << stk.top() << " ";
stk.pop();
}
return 0;
}