[Swift]LeetCode274.H指数 | H-Index

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10241095.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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:

citations = [3,0,6,1,5]
[3,0,6,1,5] 
5
3, 0, 6, 1, 5
3
3
3
3

Note: If there are several possible values for h, the maximum one is taken as the h-index.

---

给定一位研究者论文被引用次数的数组（被引用次数是非负整数）。编写一个方法，计算出研究者的 h 指数。

h 指数的定义: “h 代表“高引用次数”（high citations），一名科研人员的 h 指数是指他（她）的 （N 篇论文中）至多有 h 篇论文分别被引用了至少 h 次。（其余的 N - h 篇论文每篇被引用次数不多于 h 次。）”

示例:

citations = [3,0,6,1,5]
5
3, 0, 6, 1, 5
3 
3
3
3

---

24ms

class Solution {
    func hIndex(_ citations: [Int]) -> Int {
        let arr = citations.sorted { (num1, num2) -> Bool in
            return num1 < num2
        }
        for i in 0 ..< arr.count {
            if arr[i] >= arr.count - i {
                return arr.count - i
            }
        }
        
        return 0
    }
}

---

28ms

class Solution {
    func hIndex(_ citations: [Int]) -> Int {
        if citations.isEmpty {
            return 0
        }
        let n = citations.count
        var res = Array(repeating: 0, count: n + 1)
        
        for i in citations {
            if i > n{
                res[n] += 1
            }else {
                res[i] += 1
            }
        }
        
        for i in stride(from: n, to: 0, by: -1) {
            if res[i] >= i {
                return i
            }
            res[i-1] += res[i]
        }
        
        
        return 0
    }
}

---

28ms

class Solution {
    func hIndex(_ citations: [Int]) -> Int {
        if citations.isEmpty {
            return 0
        }
        let n = citations.count
        var res = Array(repeating: 0, count: n + 1)
        
        for i in citations {
            if i > n{
                res[n] += 1
            }else {
                res[i] += 1
            }
        }
        
        for i in stride(from: n, to: 0, by: -1) {
            if res[i] >= i {
                return i
            }
            res[i-1] += res[i]
        }
        
        
        return 0
    }
}

---

36ms

class Solution {
    func hIndex(_ citations: [Int]) -> Int {
        let n = citations.count
        if (n == 0) {return 0}
        var array = Array(repeating:0,count:n + 1)
        for i in 0..<n {
            if(citations[i] > n) { //所有比n大的都算一起，因为已经不可能是这个了，只计算有几篇
                array[n] += 1
            }
            else 
            {
                array[citations[i]] += 1             //对应的次数+1
            }
        }
        var t = 0
        for i in (0...n).reversed() {
            t = t + array[i] //累加次数
            if(t >= i) {
                return i
            }
        }
        return 0
    }
}

---

40ms

class Solution {
   func hIndex(_ citations: [Int]) -> Int {
        guard citations.count > 0 else {
            return 0
        }
        let res = citations.sorted()
        for (index,value) in res.enumerated() {
            if value >= (res.count - index){
                return res.count - index
            }
        }
    return 0
    }
}