题目描述：
We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means that the first bus (0-th indexed) travels ...
归档 2018年4月10日
[LeetCode]Bus Routes
[LeetCode]Largest Sum of Averages
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 813. 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 ...