字符串操作(连接、查找、截断、反转、大小写转换)

 

1:字符串连接

string strSample1("Hello");

string strSample2("String!");

string strSample3("strSample3");

strSample1+= strSample2;

strSample1.append(strSample3);

2:字符串查找

string strSample("Good dayString! Today is beautiful!");

size_t nOffset = strSample.find("day",2);//从下标2开始查找

if(nOffset != npos)

{

  cout << "在下标:" << nOffset << "找到了day!" << endl;

}

else

{

   cout << "没找到!" << endl;

}

找出所有的day

size_t nSubstringOffset = strSample.find("day",0);//从头开始查找

while(nSubstringOffset != npos)

{

   cout << "在下标:" << nSubstringOffset << "找到了day!" << endl;

   size_t nSearchOffset= nSubstringOffset+1;

   nSubstringOffset = strSample.find("day",nSearchOffset);

}
3:字符串截断

string strSample("Good dayString! Today is beautiful!");

strSample.erase(5,18);//Good is beautiful!

4:字符串反转

string strSample("Good dayString! Today is beautiful!");

reverse(strSample.begin(),strSample.end());

5:字符串大小写转换

string strSample("Good dayString! Today is beautiful!");

transform(strSample.begin(),strSample.end(),strSample.begin(),toupper);

string strSample1("Hello");

string strSample2("String!");

string strSample3("strSample3");

strSample1+= strSample2;

strSample1.append(strSample3);

2:字符串查找

string strSample("Good dayString! Today is beautiful!");

size_t nOffset = strSample.find("day",2);//从下标2开始查找

if(nOffset != npos)

{

  cout << "在下标:" << nOffset << "找到了day!" << endl;

}

else

{

   cout << "没找到!" << endl;

}

找出所有的day

size_t nSubstringOffset = strSample.find("day",0);//从头开始查找

while(nSubstringOffset != npos)

{

   cout << "在下标:" << nSubstringOffset << "找到了day!" << endl;

   size_t nSearchOffset= nSubstringOffset+1;

   nSubstringOffset = strSample.find("day",nSearchOffset);

}
3:字符串截断

string strSample("Good dayString! Today is beautiful!");

strSample.erase(5,18);//Good is beautiful!

4:字符串反转

string strSample("Good dayString! Today is beautiful!");

reverse(strSample.begin(),strSample.end());

5:字符串大小写转换

string strSample("Good dayString! Today is beautiful!");

transform(strSample.begin(),strSample.end(),strSample.begin(),toupper);

6:buf中查询字符e

int main()
{
	char buf[] = " hellow"; 
	char *p = strchr(buf,'e');
	if (NULL == p)
	{
		printf("查询失败\n");//查询失败返回NULL
	} 
	else
	{
		printf("p = %s\n",p);//buf中查询字符e,存在返回p的地址,ellow
	}
}

 

 

7:buf中查询字串ell

int main()
{
	char buf[] = " hellow"; 
	char *p = strstr(buf,"ell");
	if (NULL == p)
	{
		printf("查询失败\n");//查询失败返回NULL
	} 
	else
	{
		printf("p = %s\n",p);//buf中查询字串ell,存在返回p的地址,ellow
	}
}

8:字符串分割

int main()
{
	char buf[] = "abd,mike,efg,hellow"; 
	char tmp[100]; 
	strcmp(tmp,buf);

	char *p;
	p = strtok(tmp,","); // 第一次调用
	while (p != NULL)
	{
		printf("p = %s\n",p);// p = abd,p = mike,p = efg,p = hellow
		p = strtok(NULL,","); //第二次起,第一个参数需要写NULL
	}
}

9:字符串替换

Void StringReplace(string &strBase, string strSrc, string strDes)
{
	string::size_type pos = 0;
	string::size_type srcLen = strSrc.size();
	string::size_type desLen = strDes.size();
	pos=strBase.find(strSrc, pos); 
	while ((pos != string::npos))
	{
		strBase.replace(pos, srcLen, strDes);
		pos=strBase.find(strSrc, (pos+desLen));
	}
}

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

程序员的资料库

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值