J - Text Reverse HDU - 1062

格式错误2遍:没考虑到连续两个空格的情况,遇到空格最后要输出这个空格,因为题目只需要转换单词。

另外,开cin,cout加速要注意读入不能用scanf,printf,puts,getchar这些。getline,streamstream 可以结合使用

代码:

using namespace std;
#define maxn 19999
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ll long long
string s;
string tmp;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //由于开了cin,cout加速,最好全部用getline解决,配合stringstream
    int t;
    getline(cin,s);
    stringstream ss;
    ss<<s;
    ss>>t;

    while(t--)
    {
        getline(cin,s);
        int size=s.size();
        for(int i=0; i<size; i++)
        {
            if(s[i]==‘ ‘)
            {
                int len=tmp.size();
                if(len!=0){
                    rep(j,0,len)
                    {
                        cout<<tmp[len-j-1];
                    }
                    tmp.clear();
                }
                cout<<" ";
            }
            else
                tmp+=s[i];
        }
        int len=tmp.size();
        if(len)
        {
            rep(j,0,len)
            {
                cout<<tmp[len-j-1];
            }

        }

原文地址:https://www.cnblogs.com/pipitongkw1/p/10705330.html

时间: 2024-11-04 06:49:44

J - Text Reverse HDU - 1062的相关文章

hdu 1062 Text Reverse 字符串反转

Text Reverse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18240    Accepted Submission(s): 6900 Problem Description Ignatius likes to write words in reverse way. Given a single line of text

HDU 1062.Text Reverse【栈或数组或字符串流】【字符处理】【8月30】

Text Reverse 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 lin

Text Reverse(杭电oj1062)

Text Reverse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17702    Accepted Submission(s): 6717 Problem Description Ignatius likes to write words in reverse way. Given a single line of text

stack的使用-Hdu 1062

Text Reverse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51495    Accepted Submission(s): 19692 Problem Description Ignatius likes to write words in reverse way. Given a single line of text

HDU 1062 Text Reverse(水题,字符串处理)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1062 解题报告:注意一行的末尾可能是空格,还有记得getchar()吃回车符. 1 #include<cstdio> 2 #include<string.h> 3 #include<iostream> 4 #include<algorithm> 5 #include<cmath> 6 #include<deque> 7 #include&

HDOJ/HDU 1062 Text Reverse(字符串翻转~)

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 inpu

题解报告:hdu 1062 Text Reverse

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1062 解题思路:问题求解的是单词的反转... AC代码: 1 #include<bits/stdc++.h> 2 using namespace std; 3 char a[1005]; 4 int main() 5 { 6 int T,len,x,y; 7 while(cin>>T){ 8 getchar();//吃掉回车符 9 while(T--){ 10 gets(a); 11

HDU 1062 Text Reverse

字符串反转:每个单词反转,然后输出. PE做法:所有单词反转并写入另一个数组中,附代码 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 using namespace std; 5 const int N=1005; 6 int main() { 7 char ol[N],no[N]; 8 int n; 9 // freopen("C:\\CODE\\in.txt",

[hdu 1062] Text Reverse | STL-stack

原题 题目大意: t组数据,每组为一行,遇到空格时讲前面的单词反转输出. 题解: 显然的栈题,遇到空格时将当前栈输出清空即可 #include<cstdio> #include<stack> #include<cstring> using namespace std; int t,l; char s[1010]; stack <char> stk; int main() { scanf("%d",&t); getchar(); w