feat: add ts solution to lc problem: No.1224

No.1224.Maximum Equal Frequency

Author: YangFong

solution/1200-1299/1224.Maximum Equal Frequency/README.md

@@ -176,6 +176,46 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxEqualFreq(nums: number[]): number {
+    const n = nums.length;
+    const map = new Map();
+    for (const num of nums) {
+        map.set(num, (map.get(num) ?? 0) + 1);
+    }
+
+    for (let i = n - 1; i > 0; i--) {
+        for (const k of map.keys()) {
+            map.set(k, map.get(k) - 1);
+            let num = 0;
+            for (const v of map.values()) {
+                if (v !== 0) {
+                    num = v;
+                    break;
+                }
+            }
+            let isOk = true;
+            let sum = 1;
+            for (const v of map.values()) {
+                if (v !== 0 && v !== num) {
+                    isOk = false;
+                    break;
+                }
+                sum += v;
+            }
+            if (isOk) {
+                return sum;
+            }
+            map.set(k, map.get(k) + 1);
+        }
+        map.set(nums[i], map.get(nums[i]) - 1);
+    }
+    return 1;
+}
+```
+
 ### **...**
 
 ```

solution/1200-1299/1224.Maximum Equal Frequency/README_EN.md

@@ -150,6 +150,46 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxEqualFreq(nums: number[]): number {
+    const n = nums.length;
+    const map = new Map();
+    for (const num of nums) {
+        map.set(num, (map.get(num) ?? 0) + 1);
+    }
+
+    for (let i = n - 1; i > 0; i--) {
+        for (const k of map.keys()) {
+            map.set(k, map.get(k) - 1);
+            let num = 0;
+            for (const v of map.values()) {
+                if (v !== 0) {
+                    num = v;
+                    break;
+                }
+            }
+            let isOk = true;
+            let sum = 1;
+            for (const v of map.values()) {
+                if (v !== 0 && v !== num) {
+                    isOk = false;
+                    break;
+                }
+                sum += v;
+            }
+            if (isOk) {
+                return sum;
+            }
+            map.set(k, map.get(k) + 1);
+        }
+        map.set(nums[i], map.get(nums[i]) - 1);
+    }
+    return 1;
+}
+```
+
 ### **...**
 
 ```

solution/1200-1299/1224.Maximum Equal Frequency/Solution.ts

@@ -0,0 +1,35 @@
+function maxEqualFreq(nums: number[]): number {
+    const n = nums.length;
+    const map = new Map();
+    for (const num of nums) {
+        map.set(num, (map.get(num) ?? 0) + 1);
+    }
+
+    for (let i = n - 1; i > 0; i--) {
+        for (const k of map.keys()) {
+            map.set(k, map.get(k) - 1);
+            let num = 0;
+            for (const v of map.values()) {
+                if (v !== 0) {
+                    num = v;
+                    break;
+                }
+            }
+            let isOk = true;
+            let sum = 1;
+            for (const v of map.values()) {
+                if (v !== 0 && v !== num) {
+                    isOk = false;
+                    break;
+                }
+                sum += v;
+            }
+            if (isOk) {
+                return sum;
+            }
+            map.set(k, map.get(k) + 1);
+        }
+        map.set(nums[i], map.get(nums[i]) - 1);
+    }
+    return 1;
+}