Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
m = 3;
n = 5;
s_correct = [1 12 11 10 9; 2 13 14 15 8; 3 4 5 6 7];
assert(isequal(spiralIn(m,n),s_correct))
A =
1 0 0 0 9
2 0 0 0 8
3 0 0 0 7
A =
1 12 11 10 9
2 0 0 0 8
3 4 5 6 7
A =
1 12 11 10 9
2 13 0 0 8
3 4 5 6 7
A =
1 12 11 10 9
2 13 14 0 8
3 4 5 6 7
A =
1 12 11 10 9
2 13 14 15 8
3 4 5 6 7
|
2 | Pass |
m = 5;
n = 3;
s_correct = [1 12 11; 2 13 10; 3 14 9; 4 15 8; 5 6 7];
assert(isequal(spiralIn(m,n),s_correct))
A =
1 0 11
2 0 10
3 0 9
4 0 8
5 0 7
A =
1 12 11
2 0 10
3 0 9
4 0 8
5 6 7
A =
1 12 11
2 13 10
3 0 9
4 0 8
5 6 7
A =
1 12 11
2 13 10
3 14 9
4 0 8
5 6 7
A =
1 12 11
2 13 10
3 14 9
4 15 8
5 6 7
|
3 | Pass |
m = 1;
n = 1;
s_correct = 1;
assert(isequal(spiralIn(m,n),s_correct))
A =
1
A =
1
|
4 | Pass |
m = 5;
n = 0;
s_correct = zeros(5,0);
assert(isequal(spiralIn(m,n),s_correct))
|
5 | Pass |
m = 2;
n = 2;
s_correct = [1 4; 2 3];
assert(isequal(spiralIn(m,n),s_correct))
A =
1 4
2 3
A =
1 4
2 3
|
The Hitchhiker's Guide to MATLAB
2874 Solvers
Permute diagonal and antidiagonal
224 Solvers
274 Solvers
104 Solvers
2778 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!