feat: add js solution to lc problem: No.0503. Next Greater Element II

Author: zhaocchen

solution/0500-0599/0503.Next Greater Element II/README.md

@@ -67,6 +67,28 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+ var nextGreaterElements = function(nums) {
+    let n = nums.length;
+    let stack = [];
+    let res = new Array(n).fill(-1);
+    for (let i = 0; i < 2 * n; i++) {
+        let cur = nums[i % n];
+        while(stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
+            res[stack.pop()] = cur;
+        }
+        stack.push(i % n);
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

solution/0500-0599/0503.Next Greater Element II/README_EN.md

@@ -74,6 +74,28 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+ var nextGreaterElements = function(nums) {
+    let n = nums.length;
+    let stack = [];
+    let res = new Array(n).fill(-1);
+    for (let i = 0; i < 2 * n; i++) {
+        let cur = nums[i % n];
+        while(stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
+            res[stack.pop()] = cur;
+        }
+        stack.push(i % n);
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

solution/0500-0599/0503.Next Greater Element II/Solution.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+ var nextGreaterElements = function(nums) {
+    let n = nums.length;
+    let stack = [];
+    let res = new Array(n).fill(-1);
+    for (let i = 0; i < 2 * n; i++) {
+        let cur = nums[i % n];
+        while(stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
+            res[stack.pop()] = cur;
+        }
+        stack.push(i % n);
+    }
+    return res;
+};