[LeetCode]Largest Sum of Averages@Python

最新推荐文章于 2023-12-11 12:03:25 发布

原创最新推荐文章于 2023-12-11 12:03:25 发布 · 238 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode

当前文章被收录于：

leetcode

232 篇文章 0 人学习

订阅专栏查看详情

dynamic programming

当前文章被收录于：

dynamic programming

43 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

探讨了如何将一组数字A划分为最多K个相邻的非空子组，以使每个子组的平均数之和达到最大。通过动态规划算法，实现了一个解决方案，详细说明了算法的实现过程。

Largest Sum of Averages

We partition a row of numbers A into at most K adjacent (non-empty) groups, then our score is the sum of the average of each group. What is the largest score we can achieve?

Note that our partition must use every number in A, and that scores are not necessarily integers.

Example

Example:
Input:
A = [9,1,2,3,9]
K = 3
Output: 20
Explanation:
The best choice is to partition A into [9], [1, 2, 3], [9]. The answer is 9 + (1 + 2 + 3) / 3 + 9 = 20.

Solution

class Solution:
    def largestSumOfAverages(self, A: List[int], K: int) -> float:
        N = len(A)
        dp = [[0]*K for _ in range(N)]
        for i in range(N):
            for j in range(K):
                if j==0:
                    dp[i][j]= sum(A[:i+1])/(i+1)
                else:
                    if i<j:
                        break
                    for r in range(i):
                        dp[i][j] = max(dp[i][j], dp[r][j-1]+sum(A[r+1:i+1])/len(A[r+1:i+1]))
        return dp[-1][-1]