zoukankan      html  css  js  c++  java
  • hdu1062

    Text Reverse

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

    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.
     
    1. #include <iostream>
    2. #include <cstring>
    3. using namespace std;
    4. char str[1001];
    5. int main()
    6. {  
    7.  int i, len, n, j;  
    8.  scanf("%d", &n);   
    9.  getchar();  
    10.  while (n --)  
    11.  {       
    12.   gets(str);
    13.   len = strlen(str);   
    14.   for (i = 0; i < len; ++i)
    15.   {          
    16.    if (str[i]== ' ')    
    17.    {              
    18.     j = i - 1;          
    19.     while (str[j] != ' '&&j >=0)  
    20.     {                
    21.      printf("%c", str[j]);   
    22.      j --;           
    23.     }              
    24.     printf(" ");       
    25.    }          
    26.    else if (i == len - 1)      
    27.    {            
    28.     j = i;      
    29.     while (str[j] != ' '&&j >=0)       
    30.     {               
    31.      printf("%c", str[j]);       
    32.      j --;         
    33.     }        
    34.    }     
    35.   }     
    36.   printf("\n");  
    37.  } 
    38.  return 0;
    39. }     
     
     
     
     
  • 相关阅读:
    24张图,九大数据结构安排得明明白白
    mysql中的mvcc解读
    常见电商项目的数据库表设计(MySQL版)
    两万字深度介绍分布式系统原理,一文入魂
    使用消息中间件时,如何保证消息仅仅被消费一次?
    GCC/G++选项 -Wl,-Bstatic和-Wl,-Bdynamic
    sql 练习
    设计模式-单例模式
    设计模式-抽象工厂模式
    设计模式-工厂方法模式
  • 原文地址:https://www.cnblogs.com/Deng1185246160/p/2952881.html
Copyright © 2011-2022 走看看