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

猜您喜欢...

  1. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  2. Daily Interview Problem: Find the Number of Islands
  3. Daily Interview Problem: Longest Substring With K Distinct Characters
  4. Algorithm Interview Question: Max and Min with Limited Comparisons
  5. Algorithm Interview: No Adjacent Repeating Characters
  6. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  7. Generate All IP Addresses
  8. Skip the readings, focus on problems. And use all the hints!
  9. How to Play WAV music under DOS?
  10. Algorithm Interview: Determine If Linked List is Palindrome

评论 (0)

    当前页暂时没有评论。


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