Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [0 1 2 3 4];
assert(isequal(mono_increase(x),true));
|
2 | Pass |
x = [0];
assert(isequal(mono_increase(x),true));
|
3 | Pass |
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
|
4 | Pass |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
|
5 | Pass |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
|
6 | Pass |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
|
7 | Pass |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
|
8 | Pass |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
|
Return the largest number that is adjacent to a zero
3118 Solvers
273 Solvers
Make a run-length companion vector
453 Solvers
288 Solvers
369 Solvers