[Leetcode] 557. Reverse Words in a String III 解题报告

最新推荐文章于 2022-05-19 22:17:20 发布

原创最新推荐文章于 2022-05-19 22:17:20 发布 · 278 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode #解题报告 #string

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一个简单的字符串处理问题，即如何在保持单词原有顺序的情况下，将每个单词内的字符顺序进行反转。通过C++代码实现，展示了如何遍历并操作字符串中的每一个单词。

题目：

Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Example 1:

Input: "Let's take LeetCode contest"
Output: "s'teL ekat edoCteeL tsetnoc"

Note: In the string, each word is separated by single space and there will not be any extra space in the string.

思路：

练手题目，哈哈。

代码：

class Solution {
public:
    string reverseWords(string s) {
        int start = 0, end = 0;
        while (start < s.length()) {
            while (end < s.length() && s[end] != ' ') {
                ++end;
            }
            reverse(s.begin() + start, s.begin() + end);
            start = end + 1;
            end = start;
        }
        return s;
    }
};