feat: add typescript solution to lc problem: No.0274.H-Index (doocs#524)

Author: zhaocchen

solution/0200-0299/0274.H-Index/README.md

@@ -85,6 +85,30 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function hIndex(citations: number[]): number {
+    let n = citations.length;
+    let cnt = new Array(n + 1).fill(0);
+    for (let c of citations) {
+        if ( c <= n) {
+            ++cnt[c];
+        } else {
+            ++cnt[n];
+        }
+    }
+    let sum = 0;
+    for (let i = n; i > -1; --i) {
+        sum += cnt[i];
+        if (sum >= i) {
+            return i;
+        }
+    }
+    return 0;
+};
+```
+
 ### **Go**
 
 利用二分查找，定位符合条件的最大值

solution/0200-0299/0274.H-Index/README_EN.md

@@ -89,6 +89,30 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function hIndex(citations: number[]): number {
+    let n = citations.length;
+    let cnt = new Array(n + 1).fill(0);
+    for (let c of citations) {
+        if ( c <= n) {
+            ++cnt[c];
+        } else {
+            ++cnt[n];
+        }
+    }
+    let sum = 0;
+    for (let i = n; i > -1; --i) {
+        sum += cnt[i];
+        if (sum >= i) {
+            return i;
+        }
+    }
+    return 0;
+};
+```
+
 ### **Go**
 
 Use binary search to locate the maximum value that meets the conditions

solution/0200-0299/0274.H-Index/Solution.ts

@@ -0,0 +1,19 @@
+function hIndex(citations: number[]): number {
+    let n = citations.length;
+    let cnt = new Array(n + 1).fill(0);
+    for (let c of citations) {
+        if ( c <= n) {
+            ++cnt[c];
+        } else {
+            ++cnt[n];
+        }
+    }
+    let sum = 0;
+    for (let i = n; i > -1; --i) {
+        sum += cnt[i];
+        if (sum >= i) {
+            return i;
+        }
+    }
+    return 0;
+};