zoukankan      html  css  js  c++  java
  • Reversed Words

    Time Limit: 2000 ms Memory Limit: 131072 KiB

     

    Problem Description

    Some aliens are learning English. They have a very strange way in writing that they revered every word in the sentence but keep all the words in common order. For example when they want to write “one two three”, they will write down “eno owt eerht”.

    Now we’ve got some sentence written by these aliens, translate them! And maybe we will know some of their secrets!

    Input

     Multiple test cases. The first line contains a positive integer T (T <= 1000), indicating the number of test cases.

    For each test cases, there will be one line contains only lower case letters and spaces. The length of each line will be no more than 10000. Test cases which are longer than 5000 will be less than 50. Continuous letters are seen as a word, words are separated by spaces. There won’t be two adjacent spaces in the input. Space won’t be the first or the last character.

    Output

     One line per case, the translated sentence.

    Sample Input

    2
    eno owt eerht
    abcde
    

    Sample Output

    one two three
    edcba

    大意是:给你一串字符串(包含多个有空格分隔的子字符串),将每个子字符串前后倒置后并输出。
    我想了一个特别的方法:先将所有字符倒置,再从后往前输出每个子字符串。
    贴下我写的代码:
    #include<stdio.h>
    #include<string.h>
    int main ()
    {
        int e;
        while(scanf("%d",&e)!=EOF)
        {
            getchar();
            while(e--)
            {
                int n,i;
                char s[10010]={0},t;
                gets(s);
                n=strlen(s);
                for(i=0;i<n/2;i++)
                {
                    t=s[i];
                    s[i]=s[n-i-1];
                    s[n-i-1]=t;
                }
                for(i=n-1;i>=0;i--)
                {
                    if(s[i]!=' ')
                        continue;
                    printf("%s ",&s[i+1]);
                    s[i]=0;
                }
                printf("%s
    ",&s[0]);
            }
        }
        return 0;
    }

    Hint

  • 相关阅读:
    String类的常用方法(P小写)
    二维数组:判断是否有目标数
    java实现输入年份判断在哪一天(正则表达式待改进)
    Java实现八进制正整数转化为十进制数
    时钟和定时器
    电路的频率响应---带宽的定义
    stm32两轮平衡车资料
    二阶常系数齐次线性微分方程的解法
    同步积分
    陀螺仪信号解调
  • 原文地址:https://www.cnblogs.com/coder-tcm/p/8627607.html
Copyright © 2011-2022 走看看