344:反转字符串

src/main/java/leetcode/editor/cn/ReverseString.java

@@ -0,0 +1,46 @@
+//编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 char[] 的形式给出。 
+//
+// 不要给另外的数组分配额外的空间，你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。 
+//
+// 你可以假设数组中的所有字符都是 ASCII 码表中的可打印字符。 
+//
+// 
+//
+// 示例 1： 
+//
+// 输入：["h","e","l","l","o"]
+//输出：["o","l","l","e","h"]
+// 
+//
+// 示例 2： 
+//
+// 输入：["H","a","n","n","a","h"]
+//输出：["h","a","n","n","a","H"] 
+// Related Topics 递归 双指针 字符串 
+// 👍 422 👎 0
+
+package leetcode.editor.cn;
+
+//344:反转字符串
+public class ReverseString {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new ReverseString().new Solution();
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public void reverseString(char[] s) {
+            int length = s.length;
+            int size = length % 2 == 0 ? length / 2 : length / 2 + 1;
+            for (int i = 0; i < size; i++) {
+                char temp = s[i];
+                s[i] = s[length - 1 - i];
+                s[length - 1 - i] = temp;
+            }
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

src/main/java/leetcode/editor/cn/ReverseString.md

@@ -0,0 +1,19 @@
+<p>编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 <code>char[]</code> 的形式给出。</p>
+
+<p>不要给另外的数组分配额外的空间，你必须<strong><a href="https://baike.baidu.com/item/原地算法" target="_blank">原地</a>修改输入数组</strong>、使用 O(1) 的额外空间解决这一问题。</p>
+
+<p>你可以假设数组中的所有字符都是 <a href="https://baike.baidu.com/item/ASCII" target="_blank">ASCII</a> 码表中的可打印字符。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>[&quot;h&quot;,&quot;e&quot;,&quot;l&quot;,&quot;l&quot;,&quot;o&quot;]
+<strong>输出：</strong>[&quot;o&quot;,&quot;l&quot;,&quot;l&quot;,&quot;e&quot;,&quot;h&quot;]
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>[&quot;H&quot;,&quot;a&quot;,&quot;n&quot;,&quot;n&quot;,&quot;a&quot;,&quot;h&quot;]
+<strong>输出：</strong>[&quot;h&quot;,&quot;a&quot;,&quot;n&quot;,&quot;n&quot;,&quot;a&quot;,&quot;H&quot;]</pre>
+<div><div>Related Topics</div><div><li>递归</li><li>双指针</li><li>字符串</li></div></div>\n<div><li>👍 422</li><li>👎 0</li></div>

src/main/java/leetcode/editor/cn/ReverseWordsInAStringIii.java

@@ -19,30 +19,32 @@
 // 👍 300 👎 0
 
 package leetcode.editor.cn;
+
 //557:反转字符串中的单词 III
-public class ReverseWordsInAStringIii{
+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 {
+    class Solution {
-    public String reverseWords(String s) {
+        public String reverseWords(String s) {
-        StringBuilder str = new StringBuilder();
+            StringBuilder str = new StringBuilder();
-        StringBuilder ss = new StringBuilder();
+            StringBuilder ss = new StringBuilder();
-        for (char ch:s.toCharArray()){
+            for (char ch : s.toCharArray()) {
-            if(ch!=' '){
+                if (ch != ' ') {
-                str.append(ch);
+                    str.append(ch);
-            }else{
+                } else {
-                ss.append(str.reverse()).append(" ");
+                    ss.append(str.reverse()).append(" ");
-                str = new StringBuilder();
+                    str = new StringBuilder();
+                }
             }
+            ss.append(str.reverse());
+            return ss.toString();
         }
-        ss.append(str.reverse());
-        return ss.toString();
     }
-}
 //leetcode submit region end(Prohibit modification and deletion)
 
 }