solve problem Reverse String

Author: P-ppc

README.md

@@ -10,4 +10,5 @@ All solutions will be accepted!
 |476|[Number Complement](https://leetcode-cn.com/problems/number-complement/description/)|[java/py/js](./algorithms/NumberComplement)|Easy|
 |728|[Self Dividing Numbers](https://leetcode-cn.com/problems/self-dividing-numbers/description/)|[java/py/js](./algorithms/SelfDividingNumbers)|Easy|
 |804|[Unique Morse Code Words](https://leetcode-cn.com/problems/unique-morse-code-words/description/)|[java/py/js](./algorithms/UniqueMorseCodeWords)|Easy|
-|500|[Keyboard Row](https://leetcode-cn.com/problems/keyboard-row/description/)|[java/py/js](./algorithms/KeyboardRow)|Easy|
+|500|[Keyboard Row](https://leetcode-cn.com/problems/keyboard-row/description/)|[java/py/js](./algorithms/KeyboardRow)|Easy|
+|344|[Reverse String](https://leetcode-cn.com/problems/reverse-string/)|[java/py/js](./algorithms/ReverseString)|Easy|

algorithms/HammingDistance/README.md

@@ -1,2 +1,2 @@
 # Hamming Distance
-use bitwise to solve this problem
+Use bitwise to solve this problem

algorithms/KeyboardRow/README.md

@@ -1,2 +1,2 @@
 # Keyboard Row
-we can use prime product to get modulo to solve this problem, but be careful about js's Number overflow!
+We can use prime product to get modulo to solve this problem, but be careful about js's Number overflow!

algorithms/NumberComplement/README.md

@@ -1,3 +1,2 @@
 # Number Complement
-use bitwise to solve this problem
-becareful the overflow
+Use bitwise to solve this problem, becareful the overflow

algorithms/ReverseString/README.md

@@ -0,0 +1,2 @@
+# Reverse String
+This problem is easy to solve

algorithms/ReverseString/Solution.java

@@ -0,0 +1,5 @@
+class Solution {
+    public String reverseString(String s) {
+        return new StringBuffer(s).reverse().toString();
+    }
+}

algorithms/ReverseString/solution.js

@@ -0,0 +1,7 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var reverseString = function(s) {
+    return s.split('').reverse().join('')
+};

algorithms/ReverseString/solution.py

@@ -0,0 +1,9 @@
+class Solution(object):
+    def reverseString(self, s):
+        """
+        :type s: str
+        :rtype: str
+        """
+        s = list(s)
+        s.reverse()
+        return ''.join(s)