题目描述:
LeetCode 1168. Optimize Water Distribution in a Village
There are n
houses in a village. We want to supply water for all the houses by building wells and laying pipes.
For each house i
, we can either build a ...
最后更新于 .
LeetCode 1168. Optimize Water Distribution in a Village
There are n
houses in a village. We want to supply water for all the houses by building wells and laying pipes.
For each house i
, we can either build a ...
最后更新于 .
LeetCode 1115. Print FooBar Alternately
Suppose you are given the following code:
class FooBar { public void foo() { for (int i = 0; i < n; i++) { print("foo"); } } public void bar() { for ...
最后更新于 .
Suppose we have a class:
public class Foo { public void first() { print("first"); } public void second() { print("second"); } public void third() { print("third"); } }
The same instance of Foo
will be passed ...
最后更新于 .
LeetCode 1019. Next Greater Node In Linked List
We are given a linked list with head
as the first node. Let's number the nodes in the list: node_1, node_2, node_3, ...
etc.
Each node may have a next larger value ...
最后更新于 .
LeetCode 1017. Convert to Base -2
Given a number N
, return a string consisting of "0"
s and "1"
s that represents its value in base -2
(negative two).
The returned string must have no leading zeroes, unless the ...