题目描述：
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 ...
[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 ...
[LeetCode]Binary Tree Pruning
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 814. Binary Tree Pruning
We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1.
Return the same tree where every subtree (of the given tree ...
[LeetCode]Largest Triangle Area
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 812. Largest Triangle Area
You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points.
Example: Input: points = [[0,0],[0,1],[1 ...
[LeetCode]Soup Servings
作者是
发布于
在
LeetCode.
题目描述：
There are two types of soup: type A and type B. Initially we have N ml of each type of soup. There are four kinds of operations:
- Serve 100 ml of soup A and 0 ml ...