hdu 1062 Text Reverse

最新推荐文章于 2021-08-07 12:56:28 发布

XiaoYaoII

最新推荐文章于 2021-08-07 12:56:28 发布

阅读量338

点赞数

分类专栏： ACM

本文链接：https://blog.youkuaiyun.com/qq_35323001/article/details/53054850

版权

ACM 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一个简单的字符串处理问题，即如何将输入的一行文本中的单词逆序输出。通过使用C++实现，文章提供了一段AC代码，展示了如何读取多组测试数据并逐个单词进行逆序处理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1062

题目描述：

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.

题目分析：

题目本身并不是什么难的题目，但是我在这里写的原因是觉得字符串处理真的非常重要，所以还是多写几遍比较好

AC代码：

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
using namespace std;
int n;
char s[1005];
int main()
{
    cin>>n;
    getchar();
    while(n--)
    {
        gets(s);
        int l=strlen(s);
        for(int i=0;i<l;)
        {
            if(s[i]==' ')
                {
                    printf("%c",s[i]);
                    i++;
                    continue;
                }
            while(s[i]!=' '&&i<l)
                i++;
            for(int j=i-1;s[j]!=' '&&j>=0;j--)
                {
                    printf("%c",s[j]);
                }
        }
        printf("\n");
    }
    return 0;
}