274. H-Index
来源:互联网 发布:数据库的规范化设计 编辑:程序博客网 时间:2024/05/29 08:40
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 hcitations each."
For example, given citations = [3, 0, 6, 1, 5]
, which 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, his h-index is 3
.
Note: If there are several possible values for h
, the maximum one is taken as the h-index.
Hint:
- An easy approach is to sort the array first.
- What are the possible values of h-index?
- A faster approach is to use extra space.
class Solution {public: bool cmp(int a, int b) { return a>b; } int hIndex(vector<int>& citations) { if(citations.empty()) return 0; sort(citations.begin(), citations.end(),greater<int>()); for(int i = 0; i < citations.size(); ++i) { if(i>=citations[i]) return i; } return citations.size(); }};
- 274. H-Index & 275. H-Index II
- [leetcode] 274.H-Index
- Leetcode 274. H-Index
- leetcode 274. H-Index
- 274. H-Index
- 274. H-Index
- LeetCode *** 274. H-Index
- 274. H-Index
- 274. H-Index
- 274. H-Index
- 274. H-Index
- leetcode.274. H-Index
- 【leetcode】274. H-Index
- 274. H-Index
- 274. H-Index
- 274. H-Index
- LeetCode - 274. H-Index
- 274. H-Index
- WebView优化
- BFC 神奇背后的原理
- Java学习之反射机制---动态代理
- JQuery事件之change事件
- 深入浅出RxJava(二:操作符)
- 274. H-Index
- JSP学习笔记
- 1008. 数组元素循环右移问题 (20)
- 二叉树的原理和实现
- Sublime Text3配置Markdown
- Android--173个项目源码
- git checkout -b 报错
- Java的两种赋值的区别
- C#Winform程序如何发布并自动升级(图解)