LeetCode刷题:Reverse Words in a String(翻转字符串中的单词)

题目

Given an input string, reverse the string word by word.

For example,
Given s = "the sky is blue",
return "blue is sky the".

click to show clarification.

Clarification:

  • What constitutes a word?
    A sequence of non-space characters constitutes a word.
  • Could the input string contain leading or trailing spaces?
    Yes. However, your reversed string should not contain leading or trailing spaces.
  • How about multiple spaces between two words?
    Reduce them to a single space in the reversed string.

分析

(1) 去除首尾空格和去除字符串中多余的空格,计划用两个函数实现;
(2) 翻转整个字符串
(3) 依次将每个单词翻转

代码

#include <iostream>
#include <string>
#include <cwctype>
#include <vector>

using namespace std;

// 去除字符串首尾的空格
string& trim(string &s)
{
	if(s.empty())
		return s;

	string::iterator iter;
	for(iter = s.begin(); iter != s.end()&& iswspace(*iter++););
	s.erase(s.begin(),--iter);

	for(iter = s.end(); iter != s.begin()&& iswspace(*--iter););
	s.erase(++iter,s.end());

	return s;
}

// 翻转字符串中的某一段子串
void reverseString(string &s, int begin, int end)
{
	for(; begin < end; begin++,end--)
	{
		char temp = s[begin];
		s[begin] = s[end];
		s[end] = temp;
	}
}

// 删除单词之间多余的空格
void delete_mult_spaces(string &s)
{
	string::iterator blank;
	string::iterator iter = s.begin();
	while(iter != s.end())
	{
		if(iswspace(*iter))
		{
			blank = iter + 1;
			while(iswspace(*blank))
				s.erase(blank);
			iter = blank;
		}
		iter++;
	}
}

void reverseWords(string &s)
{
	if (s.empty())
		return;

	s = trim(s);
	delete_mult_spaces(s);

	reverseString(s, 0, s.length()-1);

	int wbegin,wend;
	wbegin = wend = 0;
	for(size_t i = 0; i < s.length(); i++)
	{
		if(s[i] == ' ')
		{
			reverseString(s,wbegin,wend-1);
			wbegin = wend + 1;
		}
		wend++;

		// deal with the last word
		if(i == s.length()-1)
			reverseString(s,wbegin,wend-1);
	}
}

int main()
{
	vector<string> strs;
	strs.push_back("the sky is blue");
	strs.push_back("   the sky is blue");
	strs.push_back("the sky is blue   ");

	strs.push_back("the   sky is blue");
	strs.push_back("  the sky   is   blue   ");
	strs.push_back("");

	vector<string>::iterator iter;
	for(iter = strs.begin(); iter != strs.end(); iter++)
	{
		reverseWords(*iter);
		cout  << *iter << endl;
	}
	return 0;
}


参考


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值