Merge pull request #1 from taryn2016/master

feat：添加easy第一天的js题解以及文档修改

Author: relish-wang

README.md

@@ -12,8 +12,8 @@
 ## [Easy](https://leetcode.com/problemset/all/?difficulty=Easy)题解
 |         题目         | 题解                                   | kotlin           | JavaScript |     Java      |
 | :-----------------: | -------------------------------------- | :--------------: | :-------: | :------------: |
-| [1][1-question]     | [Two Sum][1-tips]                      | [✅][1-kotlin]   |           | [✅][1-java]   |
-| [728][728-question] | [Self Dividing Numbers][728-tips]      |                  |           | [✅][728-java] |
+| [1][1-question]     | [Two Sum][1-tips]                      | [✅][1-kotlin]  |[✅][1-JavaScript] | [✅][1-java]|
+| [728][728-question] | [Self Dividing Numbers][728-tips]      |                  |[✅][728-JavaScript] | [✅][728-java] |
 | [771][771-question] | [Jewels and Stones][771-tips]          | [✅][771-kotlin] |           | [✅][771-java] |
 | [804][804-question] | [Unique Morse Code Words][804-tips]    |                  |           | [✅][804-java] |
 
@@ -28,6 +28,7 @@
 
 ## 贡献者名单
 - 感谢[@Mukyu](https://github.com/Mukyu), 提供Java题解、文档整理。
+- 感谢[@taryn](https://github.com/taryn2016), 提供JavaScript题解、文档整理。
 - 感谢[@WangXin](https://github.com/relish-wang), 提供kotlin题解、文档整理。
 
 
@@ -49,6 +50,9 @@
 [2-kotlin]: ./src/_2/kotlin/Solution.kt
 [771-kotlin]: ./src/_771/kotlin/Solution.kt
 
+[1-JavaScript]: ./src/_1/Solution.js
+[728-JavaScript]: ./src/_728/Solution.js
+
 [1-java]: ./src/_1/Solution.java
 [2-java]: ./src/_2/Solution.java
 [728-java]: ./src/_728/Solution.java

src/_1/Solution.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(nums, target) {
+    for (let i = 0; i < nums.length - 1; i++) {
+        res = target - nums[i]
+        for (let j = i + 1; j < nums.length; j++) {
+            if (nums[j] === res) {
+                return [i, j]
+            }
+        }
+        if (i === nums.length) {
+            return []
+        }
+    }
+}

src/_728/Solution.js

@@ -0,0 +1,27 @@
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {number[]}
+ */
+var selfDividingNumbers = function(left, right) {
+  var result = []
+  for (var i = left; i <= right; i++ ) {
+    if (i < 10) {
+      result.push(i)
+    } else {
+      if (/0/.test(i.toString())) {
+        i = i + 1
+      }
+      for (var j = 0; j < i.toString().length; j++) {
+        if (i % Number(i.toString().split('')[j]) !== 0) {
+          break
+        }
+        if (i % Number(i.toString().split('')[j]) === 0 && j === i.toString().length - 1) {
+          console.log(i);
+          result.push(i)
+        }
+      }
+    }
+  }
+  return result
+};

tips/1/README.md

@@ -52,3 +52,20 @@ class Solution {
     }
 }
 ```
+### JavaScript
+
+```JavaScript
+var twoSum = function(nums, target) {
+    for (let i = 0; i < nums.length - 1; i++) {
+        res = target - nums[i]
+        for (let j = i + 1; j < nums.length; j++) {
+            if (nums[j] === res) {
+                return [i, j]
+            }
+        }
+        if (i === nums.length) {
+            return []
+        }
+    }
+}
+```

tips/728/README.md

@@ -26,7 +26,7 @@ The boundaries of each input argument are 1 <= left <= right <= 10000.
 
 ### 打表（Java）
 
-```
+```Java
 int sum = 0;
 for (int i = left; i < right; i++) {
     int num = i;
@@ -46,4 +46,30 @@ for (int i = left; i < right; i++) {
         sum++;
     }
 }
-```
+```
+
+### JavaScript
+```JavaScript
+var selfDividingNumbers = function(left, right) {
+  var result = []
+  for (var i = left; i <= right; i++ ) {
+    if (i < 10) {
+      result.push(i)
+    } else {
+      if (/0/.test(i.toString())) {
+        i = i + 1
+      }
+      for (var j = 0; j < i.toString().length; j++) {
+        if (i % Number(i.toString().split('')[j]) !== 0) {
+          break
+        }
+        if (i % Number(i.toString().split('')[j]) === 0 && j === i.toString().length - 1) {
+          console.log(i);
+          result.push(i)
+        }
+      }
+    }
+  }
+  return result
+};
+```