[字符串]

从天体赛回来之后，发现好多字符串的题呀，字符串都是毒瘤题目。

再PTA上面，gets() 不能用，我用的是 

char s[110];
cin.get(s,110);

导致这种用字符串string很好写的，硬生生给我弄成了毒瘤

string s;
getline(cin,s);

 

#include<ctype.h>

isalnum:测试字符是否为英文或数字;
isalpha:测试字符是否为英文字母；
isdigit:测试字符是否为阿拉伯数字
islower:测试字符是否为小写字母
isspace:测试字符是否为空格
isupper:测试字符是否大写字母

tolower:把大写字母转成小写字母，不是大写字母的略过。

 

#include<sstream>
stringstream ss(s);
while(ss>>s)
      str[cnt++]=s;

 

substr(index,num)获取index开始，长度为num的子串
erase(index,num)删除index开始num个元素
insert(index,a) index处插入a
replace(index,num,a)从index开始num个元素替换为a字符串

pos=kk.find(s1);
        while(pos!=-1)
        {
            kk.replace(pos,s1.size(),s2);
            pos=kk.find(s1);
        }

 

string str("ab'defg");
string::iterator it;
for (it =str.begin(); it != str.end(); ++it)
{
    if ( *it == '\'')
        str.erase(it);
}    

 

PTA-天梯赛

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<list>
#include<cctype>
#include<sstream>
using namespace std;
typedef long long ll;
const int inf=0x7fffffff;
const int N=100000+100;
const int M=9999999;
const ll mod=1000000000+7;
int n;
string s;
int main()
{
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        string str[1005];
        int cnt=0;
        getline(cin,s);
        cout<<s<<endl<<"AI:";
        for(int i=0;i<s.size();i++)
        {
            if(isalnum(s[i]))
            {
                if(s[i]!='I')   s[i]=tolower(s[i]);
            }
            else
            {
                s.insert(i," ");
                i++;
            }
            if(s[i]=='?')
                s[i]='!';
        }
        stringstream ss(s);
        while(ss>>s)
            str[cnt++]=s;
        if(!isalnum(str[0][0]))
            cout<<" ";
        for(int i=0;i<cnt;i++)
        {
            if(!isalnum(str[i][0]))
                cout<<str[i];
            else if(str[i]=="can"&&str[i+1]=="you")
            {
                cout<<" I can";
                i++;
            }
            else if(str[i]=="could"&&str[i+1]=="you")
            {
                cout<<" I could";
                i++;
            }
            else if(str[i]=="I"||str[i]=="me")
                cout<<" you";
            else
                cout<<" "<<str[i];
        }
        cout<<endl;
    }

    return 0;
}

 

天梯赛是将两个独立的单词 i can 修改

月赛是将只要出现了就可以修改

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<list>
#include<cctype>
#include<sstream>
using namespace std;
typedef long long ll;
const int inf=0x7fffffff;
const int N=100000+100;
const int M=9999999;
const ll mod=1000000000+7;
int n;
string s,str[110],kk;
string s1="i can't",s2="i can";
string s3="i couldn't",s4="i could";
string s5="duxing201606nb!";
int main()
{
    while(getline(cin,s))
    {
        memset(str,0,sizeof(str));
        int cnt=0;
        for(int i=0;i<s.size();i++)
        {
            if(!isalnum(s[i]))
            {
                s.insert(i," ");
                i++;
            }
        }
        stringstream ss(s);
        while(ss>>s)
            str[cnt++]=s;
        kk.clear();
        for(int i=0;i<cnt;i++)
        {
            if(str[i]=="gao")   continue;
            if(i!=0)
                if(isalnum(str[i][0]))
                    kk.insert(kk.size()," ");
            kk.insert(kk.size(),str[i]);
        }
        int pos;
        pos=kk.find(s1);
        while(pos!=-1)
        {
            kk.replace(pos,s1.size(),s2);
            pos=kk.find(s1);
        }
        pos=kk.find(s3);
        while(pos!=-1)
        {
            kk.replace(pos,s3.size(),s4);
            pos=kk.find(s3);
        }
        for(int i=0;i<kk.size();i++)
            if(kk[i]=='.')
                kk.insert(i+1,s5);
        for(int i=0;i<kk.size();i++)
            cout<<kk[i];
        cout<<endl;

    }


    return 0;
}