给定一个字符串 s
,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例 1:
输入:s = "Let's take LeetCode contest" 输出:"s'teL ekat edoCteeL tsetnoc"
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s= sc.next();
System.out.println(reverseWords(s));
}
public static String reverseWords(String s) {
StringBuilder num=new StringBuilder();
String[] s1 = s.split(" ");
for (int i = 0; i <s1.length ; i++) {
StringBuilder ss=new StringBuilder(s1[i]);
ss.reverse();
if(i<s1.length-1){
num.append(ss+" ");
}
else {
num.append(ss);
}
}
String nums=num.toString();
return nums;
}
}