Problema
Write a function that lists numbers from start to end, moving by step each time. If start is less than or equal to end, count up: start, start + step, start + 2·step, ... while the value is at most end. If start is greater than end, count down by step instead while the value is at least end. The last value only equals end when the steps land on it exactly.
Implement range_with_increment(start, end, step).
Input
start: The first number.
end: The limit; it is included only if a step lands on it.
step: The size of each step. It must be positive.
Output
Return the numbers in the order they are produced. If step is 0 or negative, return an empty list.
Vincoli
−1000 ≤ start, end ≤ 1000
−100 ≤ step ≤ 100
Esempi
Input:
start = -15
end = 10
step = 5
Output atteso:
expected = [-15, -10, -5, 0, 5, 10]
Input:
long long start = -15;
long long end = 10;
long long step = 5;
Output atteso:
std::vector<long long> expected = {-15, -10, -5, 0, 5, 10};
Input:
long start = -15;
long end = 10;
long step = 5;
Output atteso:
long[] expected = new long[] {-15, -10, -5, 0, 5, 10};
Spiegazione
Counting up by 5 from −15 gives −15, −10, −5, 0, 5, 10, and 10 is reached exactly.
Input:
start = 20
end = 5
step = 4
Output atteso:
expected = [20, 16, 12, 8]
Input:
long long start = 20;
long long end = 5;
long long step = 4;
Output atteso:
std::vector<long long> expected = {20, 16, 12, 8};
Input:
long start = 20;
long end = 5;
long step = 4;
Output atteso:
long[] expected = new long[] {20, 16, 12, 8};
Spiegazione
start is above end, so count down: 20, 16, 12, 8; the next value 4 is below 5.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Handle a step of 0 or less first, or your loop may never end.
Suggerimento 2
Use two loops: one counting up while the value is at most end, one counting down while it is at least end.
Suggerimento 3
Check the condition before adding each value, so a value past end is never added.
Complessità attesa
O(|end − start| / step) time, O(|end − start| / step) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.