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

猜您喜欢...

  1. Daily Interview Question: Create a Simple Calculator
  2. Daily Interview Problem: Count Number of Unival Subtrees
  3. First and Last Indices of an Element in a Sorted Array
  4. Print a tree level-by-level, with line-breaks
  5. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  6. Palindrome Integers
  7. Find Missing Numbers in an Array
  8. Skip the readings, focus on problems. And use all the hints!
  9. Daily Interview Problem: Full Binary Tree
  10. Daily Interview Problem: Min Range Needed to Sort

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


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