-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0274.swift
59 lines (58 loc) · 1.63 KB
/
q0274.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
//
// q0274.swift
// LeetcodeSwift
//
// Created by NowOrNever on 18/06/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//274. H-Index
//Medium
//
//575
//
//969
//
//Add to List
//
//Share
//Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
//
//According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each."
//
//Example:
//
//Input: citations = [3,0,6,1,5]
//Output: 3
//Explanation: [3,0,6,1,5] means the researcher has 5 papers in total and each of them had
// received 3, 0, 6, 1, 5 citations respectively.
// Since the researcher has 3 papers with at least 3 citations each and the remaining
// two with no more than 3 citations each, her h-index is 3.
//Note: If there are several possible values for h, the maximum one is taken as the h-index.
//
//Accepted
//148,808
//Submissions
//419,818
class q0274Solution {
func hIndex(_ citations: [Int]) -> Int {
let citations = citations.sorted()
var result = Int.max
let len = citations.count
var left = 0
var right = len - 1
while left <= right {
let mid = (left + right) / 2
if citations[mid] >= len - mid {
result = len - mid
right = mid - 1
}else{
left = mid + 1
}
}
if result == Int.max {
return 0
}
return result
}
}