feat: update solutions to lc problem: No.2399, No.2404

Author: thinkasany

solution/2300-2399/2399.Check Distances Between Same Letters/README.md

@@ -156,7 +156,7 @@ function checkDistances(s: string, distance: number[]): boolean {
     const d: number[] = new Array(26).fill(0);
     for (let i = 1; i <= n; ++i) {
         const j = s.charCodeAt(i - 1) - 97;
-        if (d[j] && i - d[j] - 1 != distance[j]) {
+        if (d[j] && i - d[j] - 1 !== distance[j]) {
             return false;
         }
         d[j] = i;

solution/2300-2399/2399.Check Distances Between Same Letters/README_EN.md

@@ -142,7 +142,7 @@ function checkDistances(s: string, distance: number[]): boolean {
     const d: number[] = new Array(26).fill(0);
     for (let i = 1; i <= n; ++i) {
         const j = s.charCodeAt(i - 1) - 97;
-        if (d[j] && i - d[j] - 1 != distance[j]) {
+        if (d[j] && i - d[j] - 1 !== distance[j]) {
             return false;
         }
         d[j] = i;

solution/2300-2399/2399.Check Distances Between Same Letters/Solution.ts

@@ -3,7 +3,7 @@ function checkDistances(s: string, distance: number[]): boolean {
     const d: number[] = new Array(26).fill(0);
     for (let i = 1; i <= n; ++i) {
         const j = s.charCodeAt(i - 1) - 97;
-        if (d[j] && i - d[j] - 1 != distance[j]) {
+        if (d[j] && i - d[j] - 1 !== distance[j]) {
             return false;
         }
         d[j] = i;

solution/2400-2499/2404.Most Frequent Even Element/README.md

@@ -153,7 +153,7 @@ function mostFrequentEven(nums: number[]): number {
     let ans = -1;
     let mx = 0;
     for (const [x, v] of cnt) {
-        if (mx < v || (mx == v && ans > x)) {
+        if (mx < v || (mx === v && ans > x)) {
             ans = x;
             mx = v;
         }

solution/2400-2499/2404.Most Frequent Even Element/README_EN.md

@@ -140,7 +140,7 @@ function mostFrequentEven(nums: number[]): number {
     let ans = -1;
     let mx = 0;
     for (const [x, v] of cnt) {
-        if (mx < v || (mx == v && ans > x)) {
+        if (mx < v || (mx === v && ans > x)) {
             ans = x;
             mx = v;
         }

solution/2400-2499/2404.Most Frequent Even Element/Solution.ts

@@ -8,7 +8,7 @@ function mostFrequentEven(nums: number[]): number {
     let ans = -1;
     let mx = 0;
     for (const [x, v] of cnt) {
-        if (mx < v || (mx == v && ans > x)) {
+        if (mx < v || (mx === v && ans > x)) {
             ans = x;
             mx = v;
         }