zoukankan      html  css  js  c++  java
  • Text Reverse

    Text Reverse

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 1027 Accepted Submission(s): 334
    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.
    #include<iostream>
    #include <string.h>
    #include "stdio.h"
    using namespace std;
    int main()
    {
        int n;
        cin >> n;
        getchar();
        while(n--)
        {
             char a[1001];
             memset(a,0,sizeof(a));
             gets(a);
             char *p ,*q,*k;
             k = q = p = a;
    
             while(*p!=0)
             {
                  int c = 0;
                  while(*p == ' ')
                  {
                      p++;
                      cout << ' ' ;
                  }
    
                  k = p;                    //k标记字母开始的第一个位子
                  while(*p!=' ' && *p!=0) //把p移到最后字母的后一个
                     p++;
    
                  q = p;                   //q标记最后一个字符的后一个位子
    
                  p--;                     //倒退一个,p就是标记最后一个字母了,输出全都字母
                  while(p>=k)
                  {
                       cout << *p;
                       p--;
                  }
                  p = q;
    
             }
    
             cout << endl;
        }
    
        return 0;
    }
  • 相关阅读:
    【Java】:Java当中为什么不能够直接用==比较String字符串
    Mybatis
    spring boot
    IDEA
    IDEA
    kafka集群partition分布原理分析(转发)
    kafka集群partition分布原理分析(转发)
    scons ------ 基本使用
    色彩管理中的Gamma值的理解
    SFUD ------ (Serial Flash Universal Driver) 串行 Flash 通用驱动库
  • 原文地址:https://www.cnblogs.com/newpanderking/p/2114934.html
Copyright © 2011-2022 走看看