leetcode hIndex implemented with python

来源:互联网 发布:老男孩linux运维2017 编辑:程序博客网 时间:2024/05/20 08:43

视频分析:
http://v.youku.com/v_show/id_XMTMyOTc5NjMwNA==.html
题干:
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(object):    def hIndex(self, citations):        """        :type citations: List[int]        :rtype: int        """        """sort citatiosn asc"""        sortedcitations = sorted(citations)        num=len(citations)        h=num        for index in range(num):            if sortedcitations[index]>=h:                return h            else:                h-=1        return h
0 0