This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [ 1 5 8
-3 NaN 14
0 6 NaN ];
B_correct = [ 1 5 8 ];
assert(isequal(remove_nan_rows(A),B_correct))
t0 =
3 3
t1 =
1 -3 0 5 NaN 6 8 14 NaN
t2 =
1×9 logical array
0 0 0 0 1 0 0 0 1
t3 =
5 9
B =
1 5 8
|
2 | Pass |
A = 1:10;
B_correct = A;
assert(isequal(remove_nan_rows(A),B_correct))
t0 =
1 10
t1 =
1 2 3 4 5 6 7 8 9 10
t2 =
1×10 logical array
0 0 0 0 0 0 0 0 0 0
t3 =
1×0 empty double row vector
B =
1 2 3 4 5 6 7 8 9 10
|
3 | Pass |
A = [ 1 5 8
-3 NaN 14
0 6 6];
B_correct = [1 5 8; 0 6 6];
assert(isequal(remove_nan_rows(A),B_correct))
t0 =
3 3
t1 =
1 -3 0 5 NaN 6 8 14 6
t2 =
1×9 logical array
0 0 0 0 1 0 0 0 0
t3 =
5
B =
1 5 8
0 6 6
|
4 | Pass |
A = [ 1 3 6 NaN 3 NaN]';
B_correct = [1 3 6 3]';
assert(isequal(remove_nan_rows(A),B_correct))
t0 =
6 1
t1 =
1
3
6
NaN
3
NaN
t2 =
6×1 logical array
0
0
0
1
0
1
t3 =
4
6
B =
1
3
6
3
|
5 | Pass |
A = [ 1 3 6 NaN;
3 4 2 1];
B_correct = [3 4 2 1];
assert(isequal(remove_nan_rows(A),B_correct))
t0 =
2 4
t1 =
1 3 3 4 6 2 NaN 1
t2 =
1×8 logical array
0 0 0 0 0 0 1 0
t3 =
7
B =
3 4 2 1
|
7265 Solvers
2515 Solvers
The Goldbach Conjecture, Part 2
961 Solvers
1046 Solvers
Simple equation: Annual salary
3407 Solvers