feat: add 2nd ts solution to lc problem: No.1051

Author: rain84

solution/1000-1099/1051.Height Checker/README.md

@@ -253,8 +253,28 @@ func heightChecker(heights []int) int {
 }
 ```
 
+#### TypeScript
+
+````ts
+function heightChecker(heights: number[]): number {
+    const cnt = Array(101).fill(0);
+    for (const i of heights) cnt[i]++;
+
+    let ans = 0;
+    for (let j = 1, i = 0; j < 101; j++) {
+        while (cnt[j]--)
+            if (heights[i++] !== j) {
+                ans++;
+            }
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
 
 <!-- problem:end -->
+````

solution/1000-1099/1051.Height Checker/README_EN.md

@@ -244,8 +244,28 @@ func heightChecker(heights []int) int {
 }
 ```
 
+#### TypeScript
+
+````ts
+function heightChecker(heights: number[]): number {
+    const cnt = Array(101).fill(0);
+    for (const i of heights) cnt[i]++;
+
+    let ans = 0;
+    for (let j = 1, i = 0; j < 101; j++) {
+        while (cnt[j]--)
+            if (heights[i++] !== j) {
+                ans++;
+            }
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
 
 <!-- problem:end -->
+````

solution/1000-1099/1051.Height Checker/Solution2.ts

@@ -0,0 +1,14 @@
+function heightChecker(heights: number[]): number {
+    const cnt = Array(101).fill(0);
+    for (const i of heights) cnt[i]++;
+
+    let ans = 0;
+    for (let j = 1, i = 0; j < 101; j++) {
+        while (cnt[j]--)
+            if (heights[i++] !== j) {
+                ans++;
+            }
+    }
+
+    return ans;
+}