H-Index
来源:互联网 发布:淘宝网无法加入购物车 编辑:程序博客网 时间:2024/05/23 01:17
H-Index
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."
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.
排序分析
代码:
class Solution {public: int hIndex(vector<int>& citations) { if (citations.empty()) return 0; sort(citations.begin(),citations.end()); for (int i=0; i<citations.size(); i++) { if (citations[i]>=(citations.size()-i)) { return (citations.size()-i); } } return 0; }};
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index
- H-Index && H-Index II
- H-Index和H-Index II
- fjutoj 2574 宝藏
- 个人学习总结一机器学习入门(一)
- java基础技术知识点总结——存储、数组、字段和方法
- C标准库学习--可变参数函数的实现方法
- 排序(6)---总结
- H-Index
- 关于新建项目后无maven Dependencis文件夹
- 苹果c
- 数据相关的驱动和URL
- 51Nod 1349 最大值(单调栈+离线)
- 17---网络配置
- Java容器_Set_HashSet源码分析
- poj
- redis面试题