LeetCode(一）Reverse Words in a String III

u_hcy2000

于 2018-12-01 20:45:55 发布

阅读量159

点赞数

CC 4.0 BY-SA版权

分类专栏： # LeetCode刷题文章标签： LeetCode 字符串逆序算法 Reverse Words in a String III

本文链接：https://blog.youkuaiyun.com/u_hcy2000/article/details/84678287

LeetCode刷题专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种算法，用于反转字符串中每个单词的字符顺序，同时保持原有的空格和单词顺序不变。通过将字符串分割为单词数组并逆序每个单词实现。

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

题目描述：
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.

思路：
1、先将字符串分割成单词字符串数组
2、将每个单词逆序即可

class Solution {
	public String reverseWords(String s) {
       String[] strs = s.split("\\s");
       String reverseStr = "";
       for(int i = 0; i < strs.length; i++) {
    	   reverseStr += reverseEachWord(strs[i])+" ";
       }
       return reverseStr.trim();
    }
	
	public String reverseEachWord(String str) {
		char[] chs = str.toCharArray();
		for(int i = 0; i < chs.length/2; i++) {
			swap(chs, i, chs.length-1-i);
		}
		return String.valueOf(chs);
	}

	public void swap(char[] chs, int i, int j) {
		char tmp = chs[i];
		chs[i] = chs[j];
		chs[j] = tmp;
	}
}