LeetCode 557. Reverse Words in a String III (Java版; Easy)

最新推荐文章于 2025-07-29 14:24:32 发布

littlehaes

最新推荐文章于 2025-07-29 14:24:32 发布

阅读量254

点赞数

CC 4.0 BY-SA版权

文章标签：字符串 leetcode java

本文链接：https://blog.youkuaiyun.com/littlehaes/article/details/104150911

Tencent50LetCode 专栏收录该内容

9 篇文章

订阅专栏

本文详细解析了LeetCode上的经典面试题“Reverse Words in a String III”。通过Java实现，介绍了如何在保持原有单词顺序的同时，反转每个单词内的字符顺序。文章提供了完整的代码示例，并附有力扣官方题解链接，深入探讨了StringBuilder类的reverse(), setLength(), insert()等方法的使用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

welcome to my blog

LeetCode Top Interview Questions 557. Reverse Words in a String III (Java版; Easy)

题目描述

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) {
        StringBuilder sb = new StringBuilder();
        String[] strs = s.split(" ");
        for(int i=0; i<strs.length; i++){
            sb.append(core(strs[i])).append(" ");
        }
        return sb.toString().trim();
    }
    private String core(String str){
        StringBuilder sb = new StringBuilder();
        for(int i=str.length()-1; i>=0; i--){
            sb.append(str.charAt(i));
        }
        return sb.toString();
    }
}