my solution clearly works on my matlab. not here. wonder why
Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
n = 5;
a = [3 3 3 3 3;
3 2 2 2 3;
3 2 1 2 3;
3 2 2 2 3;
3 3 3 3 3];
assert(isequal(bullseye(n),a));
|
2 | Fail |
n = 7;
a = [4 4 4 4 4 4 4;
4 3 3 3 3 3 4;
4 3 2 2 2 3 4;
4 3 2 1 2 3 4;
4 3 2 2 2 3 4;
4 3 3 3 3 3 4;
4 4 4 4 4 4 4];
assert(isequal(bullseye(n),a))
|
Find the longest sequence of 1's in a binary sequence.
2440 Solvers
Find all elements less than 0 or greater than 10 and replace them with NaN
11620 Solvers
Remove any row in which a NaN appears
5978 Solvers
5736 Solvers
239 Solvers