题目描述：
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 ...
[LeetCode]Print FooBar Alternately
[LeetCode]Print in Order
作者是
发布于
在
LeetCode.
题目描述：
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]Next Greater Node In Linked List
作者是
发布于
在
LeetCode.
题目描述：
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]Convert to Base -2
作者是
发布于
在
LeetCode.
题目描述：
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 ...
[LeetCode]Capacity To Ship Packages Within D Days
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 1014. Capacity To Ship Packages Within D Days
A conveyor belt has packages that must be shipped from one port to another within D days.
The i-th package on the conveyor belt has a weight of weights ...