feat: add js solution to lc problem: No.0525

No.0525.Contiguous Array

Author: yanglbme

solution/0500-0599/0525.Contiguous Array/README.md

@@ -131,6 +131,27 @@ func max(a, b int) int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxLength = function (nums) {
+    const mp = new Map();
+    mp.set(0, -1);
+    let s = 0;
+    let ans = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        s += nums[i] == 0 ? -1 : 1;
+        if (mp.has(s)) ans = Math.max(ans, i - mp.get(s));
+        else mp.set(s, i);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/0500-0599/0525.Contiguous Array/README_EN.md

@@ -129,6 +129,27 @@ func max(a, b int) int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxLength = function (nums) {
+    const mp = new Map();
+    mp.set(0, -1);
+    let s = 0;
+    let ans = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        s += nums[i] == 0 ? -1 : 1;
+        if (mp.has(s)) ans = Math.max(ans, i - mp.get(s));
+        else mp.set(s, i);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/0500-0599/0525.Contiguous Array/Solution.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxLength = function (nums) {
+    const mp = new Map();
+    mp.set(0, -1);
+    let s = 0;
+    let ans = 0;
+    for (let i = 0; i < nums.length; ++i) {
+        s += nums[i] == 0 ? -1 : 1;
+        if (mp.has(s)) ans = Math.max(ans, i - mp.get(s));
+        else mp.set(s, i);
+    }
+    return ans;
+};