feat: add js solution to lcci problem: No.16.17.Contiguous Sequence (doocs#392)

Author: zhaocchen

lcci/16.17.Contiguous Sequence/README.md

@@ -20,6 +20,8 @@
 
 ## 解法
 
+动态规划
+
 <!-- 这里可写通用的实现逻辑 -->
 
 <!-- tabs:start -->
@@ -40,6 +42,23 @@
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+ var maxSubArray = function(nums) {
+    let dp = [-Infinity];
+    for (let i = 0; i < nums.length; i++) {
+        let cur = nums[i];
+        dp[i + 1] = Math.max(dp[i] + cur, cur);
+    }
+    return Math.max(...dp);
+};
+```
+
 ### **...**
 
 ```

lcci/16.17.Contiguous Sequence/README_EN.md

@@ -38,6 +38,23 @@
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+ var maxSubArray = function(nums) {
+    let dp = [-Infinity];
+    for (let i = 0; i < nums.length; i++) {
+        let cur = nums[i];
+        dp[i + 1] = Math.max(dp[i] + cur, cur);
+    }
+    return Math.max(...dp);
+};
+```
+
 ### **...**
 
 ```

lcci/16.17.Contiguous Sequence/Solution.js

@@ -0,0 +1,12 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+ var maxSubArray = function(nums) {
+    let dp = [-Infinity];
+    for (let i = 0; i < nums.length; i++) {
+        let cur = nums[i];
+        dp[i + 1] = Math.max(dp[i] + cur, cur);
+    }
+    return Math.max(...dp);
+};