在string中查找字符或字符串



// str_find.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"


#include <string>
#include <iostream>

int main()
{
    using namespace std;
	
	string strSample("Good day String! Today is beautiful!");
	cout<<"The sample string is:"<<endl;
	cout<<strSample<<endl<<endl;
	
	size_t nOffset = strSample.find("day",0);
	
	if(nOffset != string::npos)
	{
	    cout<<"First instance of \"day\" was found at offset " <<nOffset ;
	}
	else
	{ 
	    cout<<"Substring not found"<<endl;
	}
	cout<<endl<<endl;
	getchar();

	cout<<"Locating all instance of substring \"day\" " <<endl;
	size_t nSubstringOffset = strSample.find("day" , 0);

	while( nSubstringOffset != string::npos )
	{
	    cout<<"day found at offset " << nSubstringOffset <<endl;
		size_t nSearchOffset = nSubstringOffset + 1 ;
		nSubstringOffset = strSample.find("day", nSearchOffset );
	}
	cout<<endl;

	getchar();
	
	cout<<"Locating all instance of character 'a' "<<endl;
	const char chCharToSearch = 'a';
	size_t nCharacterOffset = strSample.find(chCharToSearch,0);
	
	while( nCharacterOffset != string::npos )
	{
	    cout<<"'"<<chCharToSearch<<"' found ";
		cout<<"at position :"<<nCharacterOffset<<endl;
		size_t nCharSearchOffset = nCharacterOffset + 1;
		nCharacterOffset = strSample.find(chCharToSearch , nCharSearchOffset);
	} 
	
	getchar();
	return 0 ;
}





评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值