LeetCode刷题:Reverse Words in a String(翻转字符串中的单词)
2024-09-02 04:38:38
题目
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue
",
return "blue is sky the
".
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;
}
参考
最新文章
- ReactJS入门(三)—— 顶层API
- 微信学习总结 09 解析接口中的消息创建时间CreateTime
- 【转】Struts1.x系列教程(7):Logic标签库
- springmvc学习第二天
- 【转】推荐一款Java反编译器,比较好用
- mongodb 操作类
- HDU 3045 Picnic Cows(斜率优化DP)
- JS调用android逻辑方法
- mysql数据修改-DEDE
- ArrayList源码剖析
- nat的翻译类型(2)--动态nat
- Node.js:上传文件,服务端如何获取文件上传进度
- LogHelper 日志记录帮助类
- python zip dict函数
- [spring boot] Table &#39;yhm.hibernate_sequence&#39; doesn&#39;t exist
- 高校表白APP-冲刺第三天
- PHP的json_encode()函数与JSON对象
- Codeforces Round #486 (Div. 3)-C. Equal Sums
- oracle数据库无法连接 The Network Adapter could not establish
- 【SVD、特征值分解、PCA关系】