zoukankan      html  css  js  c++  java
  • H-Index II @python

    Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?

    class Solution(object):
        def hIndex(self, citations):
            """
            :type citations: List[int]
            :rtype: int
            """
          
            sort_c = citations[::-1]
            for i in xrange(len(sort_c)):
                if i>= sort_c[i]:
                    return i
            return len(citations)

    ========================

    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 thanh 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
            """
            if len(citations)<=0:return 0
           
            sort_c = sorted(citations,reverse=True)
            for i in xrange(len(sort_c)):
                if i>=sort_c[i]:
                    return i
            return len(citations)      
    每天一小步,人生一大步!Good luck~
  • 相关阅读:
    Eclipse
    Android View Attributes
    Android Virtual Device
    Bootstrap
    Nginx常用命令
    [多线程]多线程(Thread、Runnable、Callable)
    Redis、MongoDB及Memcached的区别
    Linux将某目录授权给某组里的某用户
    CentOS修改locale解决调用API乱码问题
    MyBatis与Hibernate的区别?
  • 原文地址:https://www.cnblogs.com/jkmiao/p/4811393.html
Copyright © 2011-2022 走看看