Text Reverse(stack入门)

﹏ヽ暗。殇╰゛Y 2023-07-15 15:16 1阅读 0赞

### Text Reverse ###

*   *  题目：

## 题目： ##

Text Reverse  
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)  
Total Submission(s): 52966 Accepted Submission(s): 20255

Problem Description  
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.

我的代码（最开始总是有问题，后来发现是赋值=写成了==怪不得编译器提醒我’ch’ is unused ）：

#include <bits/stdc++.h>
    
    using namespace std;
    
    int main()
    {
        
        int n;
        char ch;
        scanf("%d",&n);
        getchar();
        while(n--){
        
            stack< char > s;
            while(true){
        
                ch = getchar();  //一次读入一个字符
                if(ch==' ' || ch=='\n' || ch ==EOF){
        
                    while(!s.empty()){
        
                        printf("%c",s.top());  //输出栈顶
                        s.pop();  //清除栈顶
                    }
                    if(ch=='\n' || ch==EOF)
                        break;
                    printf(" ");
                }
                else
                    s.push(ch);  //入栈
            }
            printf("\n");
        }
        return 0;
    }