feat: add solutions to lc problem: No.0557.Reverse Words in a String III

Author: yanglbme

solution/0200-0299/0200.Number of Islands/README_EN.md

@@ -6,8 +6,6 @@
 
 <p>Given an <code>m x n</code> 2D binary grid <code>grid</code> which represents a map of <code>&#39;1&#39;</code>s (land) and <code>&#39;0&#39;</code>s (water), return <em>the number of islands</em>.</p>
 
-<p>An <strong>island</strong> is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.</p>
-
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
 

solution/0500-0599/0557.Reverse Words in a String III/README.md

@@ -36,15 +36,65 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def reverseWords(self, s: str) -> str:
+        return ' '.join([t[::-1] for t in s.split(' ')])
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public String reverseWords(String s) {
+        StringBuilder res = new StringBuilder();
+        for (String t : s.split(" ")) {
+            for (int i = t.length() - 1; i >= 0; --i) {
+                res.append(t.charAt(i));
+            }
+            res.append(" ");
+        }
+        return res.substring(0, res.length() - 1);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string reverseWords(string s) {
+        for (int i = 0, n = s.size(); i < n; ++i)
+        {
+            int j = i;
+            while (++j < n && s[j] != ' ');
+            reverse(s.begin() + i, s.begin() + j);
+            i = j;
+        }
+        return s;
+    }
+};
+```
 
+### **Go**
+
+```go
+func reverseWords(s string) string {
+	t := []byte(s)
+	for i := 0; i < len(t); i++ {
+		j := i
+		for j < len(t) && t[j] != ' ' {
+			j++
+		}
+		for st, ed := i, j-1; st < ed; st, ed = st+1, ed-1 {
+			t[st], t[ed] = t[ed], t[st]
+		}
+		i = j
+	}
+	return string(t)
+}
 ```
 
 ### **...**

solution/0500-0599/0557.Reverse Words in a String III/README_EN.md

@@ -33,13 +33,63 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def reverseWords(self, s: str) -> str:
+        return ' '.join([t[::-1] for t in s.split(' ')])
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public String reverseWords(String s) {
+        StringBuilder res = new StringBuilder();
+        for (String t : s.split(" ")) {
+            for (int i = t.length() - 1; i >= 0; --i) {
+                res.append(t.charAt(i));
+            }
+            res.append(" ");
+        }
+        return res.substring(0, res.length() - 1);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string reverseWords(string s) {
+        for (int i = 0, n = s.size(); i < n; ++i)
+        {
+            int j = i;
+            while (++j < n && s[j] != ' ');
+            reverse(s.begin() + i, s.begin() + j);
+            i = j;
+        }
+        return s;
+    }
+};
+```
 
+### **Go**
+
+```go
+func reverseWords(s string) string {
+	t := []byte(s)
+	for i := 0; i < len(t); i++ {
+		j := i
+		for j < len(t) && t[j] != ' ' {
+			j++
+		}
+		for st, ed := i, j-1; st < ed; st, ed = st+1, ed-1 {
+			t[st], t[ed] = t[ed], t[st]
+		}
+		i = j
+	}
+	return string(t)
+}
 ```
 
 ### **...**

solution/0500-0599/0557.Reverse Words in a String III/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    string reverseWords(string s) {
+        for (int i = 0, n = s.size(); i < n; ++i)
+        {
+            int j = i;
+            while (++j < n && s[j] != ' ');
+            reverse(s.begin() + i, s.begin() + j);
+            i = j;
+        }
+        return s;
+    }
+};

solution/0500-0599/0557.Reverse Words in a String III/Solution.go

@@ -0,0 +1,14 @@
+func reverseWords(s string) string {
+	t := []byte(s)
+	for i := 0; i < len(t); i++ {
+		j := i
+		for j < len(t) && t[j] != ' ' {
+			j++
+		}
+		for st, ed := i, j-1; st < ed; st, ed = st+1, ed-1 {
+			t[st], t[ed] = t[ed], t[st]
+		}
+		i = j
+	}
+	return string(t)
+}

solution/0500-0599/0557.Reverse Words in a String III/Solution.java

@@ -1,13 +1,12 @@
 class Solution {
     public String reverseWords(String s) {
-        String flag = " ";
-        StringBuilder result = new StringBuilder();
-        for (String temp : s.split(flag)) {
-            for (int i = temp.length() - 1; i >= 0; i--) {
-                result.append(temp.charAt(i));
+        StringBuilder res = new StringBuilder();
+        for (String t : s.split(" ")) {
+            for (int i = t.length() - 1; i >= 0; --i) {
+                res.append(t.charAt(i));
             }
-            result.append(flag);
+            res.append(" ");
         }
-        return result.toString().substring(0, s.length());
+        return res.substring(0, res.length() - 1);
     }
 }

solution/0500-0599/0557.Reverse Words in a String III/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def reverseWords(self, s: str) -> str:
+        return ' '.join([t[::-1] for t in s.split(' ')])