From 1e18e2a7aaa076c32e508d509ada4b9861e92187 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Fri, 9 Jul 2021 14:39:45 +0800
Subject: [PATCH] =?UTF-8?q?557:=E5=8F=8D=E8=BD=AC=E5=AD=97=E7=AC=A6?=
 =?UTF-8?q?=E4=B8=B2=E4=B8=AD=E7=9A=84=E5=8D=95=E8=AF=8D=20III?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/ReverseWordsInAStringIii.java   | 48 +++++++++++++++++++
 .../editor/cn/ReverseWordsInAStringIii.md     | 18 +++++++
 2 files changed, 66 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.java
 create mode 100644 src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.md

diff --git a/src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.java b/src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.java
new file mode 100644
index 0000000..d6f6c9d
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.java
@@ -0,0 +1,48 @@
+//给定一个字符串，你需要反转字符串中每个单词的字符顺序，同时仍保留空格和单词的初始顺序。 
+//
+// 
+//
+// 示例： 
+//
+// 输入："Let's take LeetCode contest"
+//输出："s'teL ekat edoCteeL tsetnoc"
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 在字符串中，每个单词由单个空格分隔，并且字符串中不会有任何额外的空格。 
+// 
+// Related Topics 双指针 字符串 
+// 👍 300 👎 0
+
+package leetcode.editor.cn;
+//557:反转字符串中的单词 III
+public class ReverseWordsInAStringIii{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new ReverseWordsInAStringIii().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public String reverseWords(String s) {
+        StringBuilder str = new StringBuilder();
+        StringBuilder ss = new StringBuilder();
+        for (char ch:s.toCharArray()){
+            if(ch!=' '){
+                str.append(ch);
+            }else{
+                ss.append(str.reverse()).append(" ");
+                str = new StringBuilder();
+            }
+        }
+        ss.append(str.reverse());
+        return ss.toString();
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.md b/src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.md
new file mode 100644
index 0000000..cb26cbf
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.md
@@ -0,0 +1,18 @@
+<p>给定一个字符串，你需要反转字符串中每个单词的字符顺序，同时仍保留空格和单词的初始顺序。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例：</strong></p>
+
+<pre><strong>输入：</strong>&quot;Let&#39;s take LeetCode contest&quot;
+<strong>输出：</strong>&quot;s&#39;teL ekat edoCteeL tsetnoc&quot;
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong><strong><strong><strong>提示：</strong></strong></strong></strong></p>
+
+<ul>
+	<li>在字符串中，每个单词由单个空格分隔，并且字符串中不会有任何额外的空格。</li>
+</ul>
+<div><div>Related Topics</div><div><li>双指针</li><li>字符串</li></div></div>\n<div><li>👍 300</li><li>👎 0</li></div>
\ No newline at end of file