Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = [5 3 3 1 0 9 9 4 4 4 4 5 1 2 2];
r_correct = [1 1 2 1 1 1 2 1 2 3 4 1 1 1 2];
assert(isequal(run_length(x),r_correct))
|
2 | Pass |
%%
x = ones(1,20);
r_correct = 1:20;
assert(isequal(run_length(x),r_correct))
|
3 | Pass |
%%
x = [1 1 1 2 2 3 4 4 5 5 5];
r_correct = [1 2 3 1 2 1 1 2 1 2 3];
assert(isequal(run_length(x),r_correct))
|
4 | Pass |
%%
x = 1:40;
r_correct = ones(size(x));
assert(isequal(run_length(x),r_correct))
|
5 | Pass |
%%
x = [-34 -17*ones(1,100)];
r_correct = [1 1:100];
assert(isequal(run_length(x),r_correct))
|
Count from 0 to N^M in base N.
200 Solvers
198 Solvers
Find best placement for ordered dominoes (harder)
194 Solvers
Choose the best fitting dominoes
161 Solvers
193 Solvers