页面顶部 Top
文件:  root - text - article - 2020 - 01 - h-index.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1086 次阅读, 19567 次搜索 | 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:


def hIndex(publications):
# Fill this in.

print hIndex([5, 3, 3, 1, 0])
# 3
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1086 次阅读, 19567 次搜索 | 98 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Arithmetic Binary Tree
  2. Algorithm Interview: Maximum Path Sum in Binary Tree
  3. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  4. Daily Interview Puzzle: Intersection of Linked Lists
  5. Daily Interview Problem: Count Number of Unival Subtrees
  6. Batch Programming in XP
  7. Algorithm Interview: Longest Consecutive Sequence
  8. Daily Interview Problem: Min Range Needed to Sort
  9. Algorithm Interview Question: H-Index
  10. Two-Sum

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />