[LeetCode] Reverse Words in a String II
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Reverse Words in a String II相关的知识,希望对你有一定的参考价值。
Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters.
The input string does not contain leading or trailing spaces and the words are always separated by a single space.
For example,
Given s = "the sky is blue",
return "blue is sky the".
Could you do it in-place without allocating extra space?
这道题让我们翻转一个字符串中的单词,跟之前那题Reverse Words in a String没有区别,由于之前那道题我们就是用in-place的方法做的,而这道题反而更简化了题目,因为不考虑首尾空格了和单词之间的多空格了,方法还是很简单,先把每个单词翻转一遍,再把整个字符串翻转一遍,或者也可以调换个顺序,先翻转整个字符串,再翻转每个单词,参见代码如下:
class Solution { public: void reverseWords(string &s) { int left = 0; for (int i = 0; i <= s.size(); ++i) { if (i == s.size() || s[i] == ‘ ‘) { reverse(s, left, i - 1); left = i + 1; } } reverse(s, 0, s.size() - 1); } void reverse(string &s, int left, int right) { while (left < right) { char t = s[left]; s[left] = s[right]; s[right] = t; ++left; --right; } } };
类似题目:
LeetCode All in One 题目讲解汇总(持续更新中...)
以上是关于[LeetCode] Reverse Words in a String II的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode] Reverse Words in a String II
Reverse Words in a String leetcode
Leetcode 151. Reverse Words in a String