Add js solution to leetcode problem:no.0239

Author: lo0b0o

Diff for: solution/0200-0299/0239.Sliding Window Maximum/README.md

@@ -88,6 +88,36 @@
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var maxSlidingWindow = function (nums, k) {
+    let len = nums.length;
+    if (len < k) return [];
+    let res = [], win = [];
+    for (let i = 0; i < k; i++) {
+        while (win.length > 0 && nums[i] >= nums[win[win.length - 1]])
+            win.pop();
+        win.push(i);
+    }
+    res.push(nums[win[0]]);
+    for (let i = k; i < len; i++) {
+        while (win.length > 0 && nums[i] >= nums[win[win.length - 1]])
+            win.pop();
+        if (win.length > 0 && win[0] < i - k + 1)
+            win.shift();
+        win.push(i);
+        res.push(nums[win[0]]);
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

Diff for: solution/0200-0299/0239.Sliding Window Maximum/README_EN.md

@@ -79,6 +79,36 @@ Window position                Max
 
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var maxSlidingWindow = function (nums, k) {
+    let len = nums.length;
+    if (len < k) return [];
+    let res = [], win = [];
+    for (let i = 0; i < k; i++) {
+        while (win.length > 0 && nums[i] >= nums[win[win.length - 1]])
+            win.pop();
+        win.push(i);
+    }
+    res.push(nums[win[0]]);
+    for (let i = k; i < len; i++) {
+        while (win.length > 0 && nums[i] >= nums[win[win.length - 1]])
+            win.pop();
+        if (win.length > 0 && win[0] < i - k + 1)
+            win.shift();
+        win.push(i);
+        res.push(nums[win[0]]);
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

Diff for: solution/0200-0299/0239.Sliding Window Maximum/Solution.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var maxSlidingWindow = function (nums, k) {
+    let len = nums.length;
+    if (len < k) return [];
+    let res = [], win = [];
+    for (let i = 0; i < k; i++) {
+        while (win.length > 0 && nums[i] >= nums[win[win.length - 1]])
+            win.pop();
+        win.push(i);
+    }
+    res.push(nums[win[0]]);
+    for (let i = k; i < len; i++) {
+        while (win.length > 0 && nums[i] >= nums[win[win.length - 1]])
+            win.pop();
+        if (win.length > 0 && win[0] < i - k + 1)
+            win.shift();
+        win.push(i);
+        res.push(nums[win[0]]);
+    }
+    return res;
+};