杭电acm1062 Text Reverse

本文介绍了一个ACM竞赛题目“TextReverse”的解决方案,该题目要求反转输入文本中的每个单词。文章提供了一段Java代码实现,通过读取多组测试数据并输出反转后的单词来解决问题。

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

Text Reverse

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34449    Accepted Submission(s): 13532


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.

//简单的字符串处理

/**
 * date:2017.11.12
 * author:孟小德
 * function:acm试题1062
 *  Text Reverse 文本倒置
 */



import java.util.*;

public class acm1062
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);

        int num = input.nextInt();
        input.nextLine();

        String[] string = new String[num];
        for (int i=0;i<num;i++)
        {
            string[i] = input.nextLine();
        }

        String[] result = new String[num];
        for (int i=0;i<num;i++)
        {

            String[] str = string[i].split(" ");    //分割字符串

            result[i] = stringReverse(str[0]);
            for (int j = 1;j<str.length;j++)
            {
                result[i] = result[i] + " " + stringReverse(str[j]);
            }

            //末尾空格加上
            int n = string[i].length() - result[i].length();
            for (int j = 0;j<n;j++)
            {
                result[i] += " ";
            }

        }

        for (int i = 0;i<num;i++)
        {
            System.out.println(result[i]);
        }
    }

    //翻转单词字母
    public static String stringReverse(String str)
    {

        if (str.equals(""))
        {
            return "";
        }
        else
        {
            String string = String.valueOf(str.charAt(str.length()-1));
            for (int i=str.length()-2;i>=0;i--)
            {
                string += String.valueOf(str.charAt(i));

            }

            return string;
        }
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值