2021-07-22

该程序实现了一个简单的字符串匹配功能,通过输入字符串n和目标子串pmt,判断n中是否包含pmt。如果找到,输出'AAAAAA',否则输出'Abuchulaile'。程序利用了C++ std::string 的find方法,该方法从指定位置开始查找子串,并返回匹配的起始位置,若未找到则返回npos。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

字符串匹配

在这里插入图片描述

# include<iostream>
# include<string>
using namespace std;

string str;
int main(){
    const string pmt="114514";
    
    int n;
    cin >> n;
    while(n --){
        cin >> str;
        if(str.find(pmt) != string::npos)cout<<"AAAAAA"<<endl;
        else cout << "Abuchulaile" << '\n';
    }

    return 0;
}
std::basic_string<CharT,Traits,Allocator>::find

Finds the first substring equal to the given character sequence. Search begins at pos, i.e. the found substring must not begin in a position preceding pos.

The find() used for finding the first substring equal to str.
Parameters
str - string to search for
pos - position at which to start the search

std::basic_string<CharT,Traits,Allocator>::npos

This is a special value equal to the maximum value representable by the type size_type. The exact meaning depends on context, but it is generally used either as end of string indicator by the functions that expect a string index or as the error indicator by the functions that return a string index.

Note
Although the definition uses -1, size_type is an unsigned integer type, and the value of npos is the largest positive value it can hold, due to signed-to-unsigned implicit conversion. This is a portable way to specify the largest value of any unsigned type.

评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值