文件: root - text - article - 2020 - 01 - h-index.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1350 次阅读, 22759 次搜索 | 98 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1350 次阅读, 22759 次搜索 | 98 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Amazon:
The h-index is a metric that attempts to measure the productivity and citation impact of the publication of a scholar. The definition of the h-index is if a scholar has at least h of their papers cited h times.
Given a list of publications of the number of citations a scholar has, find their h-index.
Example:
Input: [3, 5, 0, 1, 3]
Output: 3
Explanation:
There are 3 publications with 3 or more citations, hence the h-index is 3.
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1350 次阅读, 22759 次搜索 | 98 个单词 The h-index is a metric that attempts to measure the productivity and citation impact of the publication of a scholar. The definition of the h-index is if a scholar has at least h of their papers cited h times.
Given a list of publications of the number of citations a scholar has, find their h-index.
Example:
Input: [3, 5, 0, 1, 3]
Output: 3
Explanation:
There are 3 publications with 3 or more citations, hence the h-index is 3.
Here's a starting point:
def hIndex(publications):
# Fill this in.
print hIndex([5, 3, 3, 1, 0])
# 3
猜您喜欢...
- Palindrome Integers
- Plus One
- Making a Height Balanced Binary Search Tree
- [Daily Problem] Longest Palindromic Substring
- Algorithm Interview: Convert Roman Numerals to Decimal
- Windows Scripting
- Algorithm Interview: Subarray With Target Sum
- Find Missing Numbers in an Array
- Binary Tree Level with Minimum Sum
- First and Last Indices of an Element in a Sorted Array
©2006~2024 牛排过熟 - 0.00952 秒 - 2022.564 KB/s - 38 在线 内存: 490.94 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。