update

Author: liuhanqu

README.md

@@ -14,6 +14,7 @@ LeetCode Problems' Solutions in JavaScript
 8.  [反转整数](./algorithms/easy/reverse/reverse.js)
 9.  [第一个错误的版本](./algorithms/easy/solution/solution.js)
 10. [两个数组的交集 II](./algorithms/easy/intersect/intersect.js)
+11. [汉明距离](./algorithms/easy/hammingDistance/hammingDistance.js)
 
 ## medium
 

algorithms/easy/hammingDistance/hammingDistance.js

@@ -0,0 +1,11 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/26/others/65/
+// 汉明距离
+
+/**
+ * @param {number} x
+ * @param {number} y
+ * @return {number}
+ */
+var hammingDistance = function(x, y) {
+  return (x ^ y).toString(2).replace(/0/g, "").length;
+};

algorithms/easy/rotate/rotate.js

@@ -0,0 +1,8 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/31/
+// 旋转图像
+
+/**
+ * @param {number[][]} matrix
+ * @return {void} Do not return anything, modify matrix in-place instead.
+ */
+var rotate = function(matrix) {};

algorithms/medium/threeSum/threeSum.js

@@ -0,0 +1,10 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-medium/29/array-and-strings/75/
+// 三数之和
+
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+var threeSum = function(nums) {
+  //
+};