feat: add solutions to lc problem: No. 0274.H-Index

Author: maolonglong

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

@@ -18,7 +18,7 @@
 
 <pre>
 <strong>输入：</strong><code>citations = [3,0,6,1,5]</code>
-<strong>输出：</strong>3 
+<strong>输出：</strong>3
 <strong>解释：</strong>给定数组表示研究者总共有 <code>5</code> 篇论文，每篇论文相应的被引用了 <code>3, 0, 6, 1, 5</code> 次。
      由于研究者有 <code>3 </code>篇论文每篇 <strong>至少 </strong>被引用了 <code>3</code> 次，其余两篇论文每篇被引用 <strong>不多于</strong> <code>3</code> 次，所以她的 <em>h </em>指数是 <code>3</code>。</pre>
 
@@ -31,22 +31,91 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+最简单的解法就是排序之后再判断，但是因为 `H` 不可能大于论文的总数 `n`，所以可以用计数排序进行优化。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def hIndex(self, citations: List[int]) -> int:
+        n = len(citations)
+        cnt = [0 for i in range(n + 1)]
+        for c in citations:
+            if c <= n:
+                cnt[c] += 1
+            else:
+                cnt[n] += 1
+        sum = 0
+        for i in range(n, -1, -1):
+            sum += cnt[i]
+            if sum >= i:
+                return i
+        return 0
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int hIndex(int[] citations) {
+        int n = citations.length;
+        int[] cnt = new int[n + 1];
+        for (int c : citations) {
+            if (c <= n) {
+                ++cnt[c];
+            } else {
+                ++cnt[n];
+            }
+        }
+        int sum = 0;
+        for (int i = n; i >= 0; --i) {
+            sum += cnt[i];
+            if (sum >= i) {
+                return i;
+            }
+        }
+        return 0;
+    }
+}
+```
 
+### **Go**
+
+利用二分查找，定位符合条件的最大值
+
+```go
+func hIndex(citations []int) int {
+	n := len(citations)
+	left, right := 0, n
+	for left+1 < right {
+		mid := int(uint(left+right) >> 1)
+		if check(citations, mid) {
+			left = mid
+		} else {
+			right = mid
+		}
+	}
+	if check(citations, right) {
+		return right
+	}
+	return left
+}
+
+func check(citations []int, mid int) bool {
+	cnt := 0
+	for _, citation := range citations {
+		if citation >= mid {
+			cnt++
+		}
+	}
+	return cnt >= mid
+}
 ```
 
 ### **...**

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

@@ -39,18 +39,87 @@ Since the researcher has 3 papers with at least 3 citations each and the remaini
 
 ## Solutions
 
+The simplest solution is to judge after sort, but because `H` cannot be greater than the total number of papers, it can be optimized by counting sort.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def hIndex(self, citations: List[int]) -> int:
+        n = len(citations)
+        cnt = [0 for i in range(n + 1)]
+        for c in citations:
+            if c <= n:
+                cnt[c] += 1
+            else:
+                cnt[n] += 1
+        sum = 0
+        for i in range(n, -1, -1):
+            sum += cnt[i]
+            if sum >= i:
+                return i
+        return 0
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int hIndex(int[] citations) {
+        int n = citations.length;
+        int[] cnt = new int[n + 1];
+        for (int c : citations) {
+            if (c <= n) {
+                ++cnt[c];
+            } else {
+                ++cnt[n];
+            }
+        }
+        int sum = 0;
+        for (int i = n; i >= 0; --i) {
+            sum += cnt[i];
+            if (sum >= i) {
+                return i;
+            }
+        }
+        return 0;
+    }
+}
+```
 
+### **Go**
+
+Use binary search to locate the maximum value that meets the conditions
+
+```go
+func hIndex(citations []int) int {
+	n := len(citations)
+	left, right := 0, n
+	for left+1 < right {
+		mid := int(uint(left+right) >> 1)
+		if check(citations, mid) {
+			left = mid
+		} else {
+			right = mid
+		}
+	}
+	if check(citations, right) {
+		return right
+	}
+	return left
+}
+
+func check(citations []int, mid int) bool {
+	cnt := 0
+	for _, citation := range citations {
+		if citation >= mid {
+			cnt++
+		}
+	}
+	return cnt >= mid
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,26 @@
+func hIndex(citations []int) int {
+	n := len(citations)
+	left, right := 0, n
+	for left+1 < right {
+		mid := int(uint(left+right) >> 1)
+		if check(citations, mid) {
+			left = mid
+		} else {
+			right = mid
+		}
+	}
+	if check(citations, right) {
+		return right
+	}
+	return left
+}
+
+func check(citations []int, mid int) bool {
+	cnt := 0
+	for _, citation := range citations {
+		if citation >= mid {
+			cnt++
+		}
+	}
+	return cnt >= mid
+}

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

@@ -0,0 +1,15 @@
+class Solution:
+    def hIndex(self, citations: List[int]) -> int:
+        n = len(citations)
+        cnt = [0 for i in range(n + 1)]
+        for c in citations:
+            if c <= n:
+                cnt[c] += 1
+            else:
+                cnt[n] += 1
+        sum = 0
+        for i in range(n, -1, -1):
+            sum += cnt[i]
+            if sum >= i:
+                return i
+        return 0