solves reverse words in string iii

Author: anishLearnsToCode

Diff for: README.md

@@ -145,7 +145,7 @@
 | 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | Easy | [![Java](assets/java.png)](src/ReverseStringII.java/) [![Python](assets/python.png)](python/reverse_string_ii.py) |
 | 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | Easy | [![Java](assets/java.png)](src/DiameterOfBinaryTree.java) [![Python](assets/python.png)](python/diameter_of_binary_tree.py) |
 | 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | Easy | [![Java](assets/java.png)](src/StudentAttendanceRecordI.java) [![Python](assets/python.png)](python/student_attendance_record_I.py) |
-| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | |
+| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | [![Java](assets/java.png)](src/ReverseWordsInStringIII.java) [![Python](assets/python.png)](python/reverse_words_in_string_iii.py) |
 | 559 | [Maximum Depth of N-Ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | Easy | |
 | 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | Easy | |
 | 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | |

Diff for: python/reverse_words_in_string_iii.py

@@ -0,0 +1,6 @@
+class Solution:
+    def reverseWords(self, s: str) -> str:
+        result = ''
+        for word in s.split():
+            result += word[::-1] + ' '
+        return result[:-1]

Diff for: src/ReverseWordsInStringIII.java

@@ -0,0 +1,15 @@
+public class ReverseWordsInStringIII {
+    public String reverseWords(String s) {
+        StringBuilder result = new StringBuilder(), buffer = new StringBuilder();
+        for (int index = 0 ; index < s.length() ; index++) {
+            if (s.charAt(index) == ' ') {
+                result.append(result.length() == 0 ? "" : ' ').append(buffer.reverse());
+                buffer = new StringBuilder();
+            } else {
+                buffer.append(s.charAt(index));
+            }
+        }
+        result.append(result.length() == 0 ? "" : ' ').append(buffer.reverse());
+        return result.toString();
+    }
+}