Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
x = [0 1 2 3 4];
assert(isequal(mono_increase(x),true));
|
2 | Fail |
x = [0];
assert(isequal(mono_increase(x),true));
tf =
logical
0
|
3 | Fail |
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
|
4 | Fail |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
|
5 | Fail |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
|
6 | Fail |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
|
7 | Fail |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
|
8 | Fail |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
|
Maximum running product for a string of numbers
816 Solvers
225 Solvers
276 Solvers
191 Solvers
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
197 Solvers