• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            Uriel's Corner

            Research Associate @ Harvard University / Research Interests: Computer Vision, Biomedical Image Analysis, Machine Learning
            posts - 0, comments - 50, trackbacks - 0, articles - 594
            Given the age and score of each players. Selected some of them to obtain the maximum total score and make sure that all the selected players with a younger age do not have a higher score than older ones (could be the same score).

            Two ways to do DP
            Approach 1: zip the age and score of each player, sort by score, then go through all the players' age and sco, update dp matrix as:
            dp[age] = max(dp[:age+1]) + sco
            return max(dp)

            Approach 2: zip the age and score of each player, sort by age, then go through all the players i, update dp matrix as:
            dp[i] = max(dp[i], dp[j] + scores_sorted_by_age[i][1]), while j < i and scores_sorted_by_age[j][1] <= scores_sorted_by_age[i][1]:
            return max(dp)

            - Time complexity:
            Both methods are O(n^2)
            - Space complexity:
            Both methods are O(n)


            Approach 1:

             1 #1626
             2 #Runtime: 285 ms (Beats 100%)
             3 #Memory 13.8 MB (Beats 80%)
             4 
             5 class Solution(object):
             6     def bestTeamScore(self, scores, ages):
             7         """
             8         :type scores: List[int]
             9         :type ages: List[int]
            10         :rtype: int
            11         """
            12         dp = [0] * (max(ages) + 1)
            13         scores_sorted_by_scores = sorted(zip(scores, ages))
            14         for sco, age in scores_sorted_by_scores:
            15             dp[age] = max(dp[:age+1]) + sco
            16         return max(dp)


            Approach 2:

             1 #1626
             2 #Runtime: 1532 ms (Beats 55%)
             3 #Memory: 13.9 MB (Beats 65%)
             4 
             5 class Solution(object):
             6     def bestTeamScore(self, scores, ages):
             7         """
             8         :type scores: List[int]
             9         :type ages: List[int]
            10         :rtype: int
            11         """
            12         dp = [0] * len(ages)
            13         scores_sorted_by_age = sorted(zip(ages, scores))
            14         for i in range(len(ages)):
            15             dp[i] = scores_sorted_by_age[i][1]
            16             for j in range(i):
            17                 if scores_sorted_by_age[j][1] <= scores_sorted_by_age[i][1]:
            18                     dp[i] = max(dp[i], dp[j] + scores_sorted_by_age[i][1])
            19         return max(dp)
            精品久久久久久久中文字幕 | 伊人久久久AV老熟妇色| 超级碰碰碰碰97久久久久| 综合网日日天干夜夜久久 | 99久久婷婷国产一区二区| 国产成人精品综合久久久| 青青青青久久精品国产h久久精品五福影院1421 | 成人综合伊人五月婷久久| 四虎国产精品免费久久久| 欧美精品国产综合久久| 少妇内射兰兰久久| 精品久久久久久中文字幕大豆网| 亚洲欧美伊人久久综合一区二区 | 内射无码专区久久亚洲| 日韩人妻无码精品久久久不卡| 曰曰摸天天摸人人看久久久| 熟妇人妻久久中文字幕| 香蕉久久久久久狠狠色| 久久艹国产| 999久久久免费国产精品播放| 五月丁香综合激情六月久久| 久久亚洲国产成人精品无码区| 久久精品国产91久久麻豆自制| 国内精品伊人久久久久妇| 大蕉久久伊人中文字幕| 大伊人青草狠狠久久| 久久久久久人妻无码| 99久久国产精品免费一区二区| 亚洲国产成人精品久久久国产成人一区二区三区综 | 91麻豆精品国产91久久久久久| 国产综合久久久久久鬼色| 久久这里只有精品18| 日本人妻丰满熟妇久久久久久| 久久国产色av免费看| 性欧美丰满熟妇XXXX性久久久 | 久久ww精品w免费人成| 亚洲精品乱码久久久久久中文字幕| 中文字幕无码久久久| 性做久久久久久久久| 久久亚洲精品国产精品婷婷| 欧美久久久久久|