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

Author: rain84

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

@@ -253,6 +253,25 @@ 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 -->

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

@@ -139,7 +139,7 @@ func heightChecker(heights []int) int {
 
 #### TypeScript
 
-````ts
+```ts
 function heightChecker(heights: number[]): number {
     const expected = [...heights].sort((a, b) => a - b);
     let ans = 0;
@@ -149,7 +149,8 @@ function heightChecker(heights: number[]): number {
     }
 
     return ans;
-}```
+}
+```
 
 <!-- tabs:end -->
 
@@ -177,7 +178,7 @@ class Solution:
                     ans += 1
                 i += 1
         return ans
-````
+```
 
 #### Java
 
@@ -244,6 +245,25 @@ 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 -->

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;
+}