largest-sum-of-averages

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given an integer array <code>nums</code> and an integer <code>k</code>. You can partition the array into at most <code>k</code> non-empty adjacent subarrays. The score of a partition is the sum of the averages of each subarray.

Note that the partition must use every integer in <code>nums</code>, and that the score is not necessarily an integer.

Return the maximum score you can achieve of all the possible partitions. Answers within <code>10-6</code> of the actual answer will be accepted.

&nbsp;
Example 1:

<pre>
Input: nums = [9,1,2,3,9], k = 3
Output: 20.00000
Explanation: 
The best choice is to partition nums into [9], [1, 2, 3], [9]. The answer is 9 + (1 + 2 + 3) / 3 + 9 = 20.
We could have also partitioned nums into [9, 1], [2], [3, 9], for example.
That partition would lead to a score of 5 + 2 + 6 = 13, which is worse.
</pre>

Example 2:

<pre>
Input: nums = [1,2,3,4,5,6,7], k = 4
Output: 20.50000
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>