#1197 : Give My Text Back

最新推荐文章于 2023-12-12 16:00:28 发布

闻道-问道

最新推荐文章于 2023-12-12 16:00:28 发布

阅读量1.2k

点赞数

分类专栏： hihocode 模拟文章标签：字符串处理

本文链接：https://blog.csdn.net/a1046765624/article/details/79619437

版权

hihocode 同时被 2 个专栏收录

43 篇文章 0 订阅

订阅专栏

模拟

11 篇文章 0 订阅

订阅专栏

时间限制: 10000ms

单点时限: 1000ms

内存限制: 256MB

描述

To prepare for the English exam Little Ho collected many digital reading materials. Unfortunately the materials are messed up by a malware.

It is known that the original text contains only English letters (a-zA-Z), spaces, commas, periods and newlines, conforming to the following format:

1. Each sentence contains at least one word, begins with a letter and ends with a period.

2. In a sentence the only capitalized letter is the first letter.

3. In a sentence the words are separated by a single space or a comma and a space.

4. The sentences are separated by a single space or a single newline.

It is also known the malware changes the text in the following ways:

1. Changing the cases of letters.

2. Adding spaces between words and punctuations.

Given the messed text, can you help Little Ho restore the original text?

输入

A string containing no more than 8192 English letters (a-zA-Z), spaces, commas, periods and newlines which is the messed text.

输出

The original text.

样例输入

my Name  is Little   Hi.
His   name IS Little ho  ,  We are   friends.

样例输出

My name is little hi.
His name is little ho, we are friends.

这道题虽然只是个简单的模拟就可以。但是弄的我很惨，发下来，做个几年教训，以后遇到细节的希望能写好。

先把所有字母变成小写，空格去掉，在进行输出，增加大写字母的操作。

代码：

#include <bits/stdc++.h>

using namespace std;
/*
97 122
65 90
*/
int main()
{
        string a;
        string b;
        while(getline(cin,a))
        {
        b="";
        int l=a.size();
        for(int i=0;i<l;i++)
        {
            if(a[i]>='A'&&a[i]<='Z')
            {
                b+=(a[i]+32);
            }
            else
            {
                if(a[i]==' '&&a[i+1]==' ')continue;
                if(a[i]==' '&&a[i+1]==',')continue;
                if(a[i]==' '&&a[i+1]=='.')continue;
                if(a[i]==','&&a[i+1]!=' ')
                {
                    b+=a[i];
                    b+=' ';
                    continue;
                }
                if(a[i]=='.'&&a[i+1]!=' ')
                {
                    b+=a[i];
                    b+=' ';
                    continue;
                }
                b+=a[i];
            }
        }
        int le=b.size();
        int ju=1;
        for(int i=0;i<le;i++)
        {
            if(b[i]=='.')
            {
                ju=1;
                continue;
            }
            if(ju)
            {
                if(b[i]>='a'&&b[i]<='z')
                {
                    b[i]=b[i]-32;
                    ju=0;
                }
            }

        }
        cout<<b<<endl;

        }
    return 0;
}