feat: add javascript solution to lc problem: No.1019.Next Greater Node In Linked List (doocs#407)

Author: zhaocchen

solution/1000-1099/1019.Next Greater Node In Linked List/README.md

@@ -110,6 +110,40 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {number[]}
+ */
+var nextLargerNodes = function(head) {
+    let nums = [];
+    while (head != null) {
+        nums.push(head.val);
+        head = head.next;
+    }
+    const n = nums.length;
+    let larger = new Array(n).fill(0);
+    let stack = [];
+    for (let i = 0; i < n; i++) {
+        let num = nums[i];
+        while (stack.length > 0 && nums[stack[stack.length - 1]] < num) {
+            larger[stack.pop()] = num;
+        }
+        stack.push(i);
+    }
+    return larger;
+};
+```
+
 ### **...**
 
 ```

solution/1000-1099/1019.Next Greater Node In Linked List/README_EN.md

@@ -124,6 +124,40 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {number[]}
+ */
+var nextLargerNodes = function(head) {
+    let nums = [];
+    while (head != null) {
+        nums.push(head.val);
+        head = head.next;
+    }
+    const n = nums.length;
+    let larger = new Array(n).fill(0);
+    let stack = [];
+    for (let i = 0; i < n; i++) {
+        let num = nums[i];
+        while (stack.length > 0 && nums[stack[stack.length - 1]] < num) {
+            larger[stack.pop()] = num;
+        }
+        stack.push(i);
+    }
+    return larger;
+};
+```
+
 ### **...**
 
 ```

solution/1000-1099/1019.Next Greater Node In Linked List/Solution.js

@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {number[]}
+ */
+ var nextLargerNodes = function(head) {
+    let nums = [];
+    while (head != null) {
+        nums.push(head.val);
+        head = head.next;
+    }
+    const n = nums.length;
+    let larger = new Array(n).fill(0);
+    let stack = [];
+    for (let i = 0; i < n; i++) {
+        let num = nums[i];
+        while (stack.length > 0 && nums[stack[stack.length - 1]] < num) {
+            larger[stack.pop()] = num;
+        }
+        stack.push(i);
+    }
+    return larger;
+};