*Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.
Output
For each test case, you should output the text which is processed.
Sample Input
3
olleh !dlrow
m’I morf .udh
I ekil .mca
Sample Output
hello world!
I’m from hdu.
I like acm.
Hint
Remember to use getchar() to read ‘\n’ after the interger T, then you may use gets() to read a line and process it.*
提示很重要 在输入字符串之前要用getchar()吃掉多余的回车,由于此题字符串中含有空格所以应用getline(cin,s)此题用栈解题。
代码如下:
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <stdio.h>
#include <cstdio>
using namespace std;
int main()
{
int t;
cin >> t;
getchar();
while (t--)
{
string s;
getline(cin, s);
int len;
len = (int)s.size();
stack<char> st;
for (int i = 0; i < len; i++)
{
if (s[i] != ' ')
{
st.push(s[i]);
}
if (s[i] == ' ' || i == len - 1)
{
while (!st.empty())
{
printf("%c", st.top());
st.pop();
}
if (s[i] == ' ')
{
cout << " ";
}
}
}
cout << endl;
}
return 0;
}