feat: update ts solution to lc problem: No.1481 (#3191)

Author: rain84

solution/1400-1499/1481.Least Number of Unique Integers after K Removals/README.md

@@ -160,13 +160,11 @@ func findLeastNumOfUniqueInts(arr []int, k int) int {
 function findLeastNumOfUniqueInts(arr: number[], k: number): number {
     const cnt: Map<number, number> = new Map();
     for (const x of arr) {
-        cnt.set(x, (cnt.get(x) || 0) + 1);
+        cnt.set(x, (cnt.get(x) ?? 0) + 1);
     }
-    const nums: number[] = [];
-    for (const [_, v] of cnt) {
-        nums.push(v);
-    }
-    nums.sort((a, b) => a - b);
+
+    const nums = [...cnt.values()].sort((a, b) => a - b);
+
     for (let i = 0; i < nums.length; ++i) {
         k -= nums[i];
         if (k < 0) {

solution/1400-1499/1481.Least Number of Unique Integers after K Removals/README_EN.md

@@ -174,13 +174,11 @@ func findLeastNumOfUniqueInts(arr []int, k int) int {
 function findLeastNumOfUniqueInts(arr: number[], k: number): number {
     const cnt: Map<number, number> = new Map();
     for (const x of arr) {
-        cnt.set(x, (cnt.get(x) || 0) + 1);
+        cnt.set(x, (cnt.get(x) ?? 0) + 1);
     }
-    const nums: number[] = [];
-    for (const [_, v] of cnt) {
-        nums.push(v);
-    }
-    nums.sort((a, b) => a - b);
+
+    const nums = [...cnt.values()].sort((a, b) => a - b);
+
     for (let i = 0; i < nums.length; ++i) {
         k -= nums[i];
         if (k < 0) {

solution/1400-1499/1481.Least Number of Unique Integers after K Removals/Solution.ts

@@ -1,13 +1,11 @@
 function findLeastNumOfUniqueInts(arr: number[], k: number): number {
     const cnt: Map<number, number> = new Map();
     for (const x of arr) {
-        cnt.set(x, (cnt.get(x) || 0) + 1);
+        cnt.set(x, (cnt.get(x) ?? 0) + 1);
     }
-    const nums: number[] = [];
-    for (const [_, v] of cnt) {
-        nums.push(v);
-    }
-    nums.sort((a, b) => a - b);
+
+    const nums = [...cnt.values()].sort((a, b) => a - b);
+
     for (let i = 0; i < nums.length; ++i) {
         k -= nums[i];
         if (k < 0) {