Cody

# Problem 25. Remove any row in which a NaN appears

Solution 1405312

Submitted on 5 Jan 2018 by claus becker
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

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))

J = 3×3 logical array 0 0 0 0 1 0 0 0 1 u = 0 1 1 l = 3×1 logical array 0 1 1 q = 3 3 A = 1 5 8 -3 NaN 14 A = 1 5 8 ans = "hi" B = 1 5 8

2   Pass
A = 1:10; B_correct = A; assert(isequal(remove_nan_rows(A),B_correct))

J = 1×10 logical array 0 0 0 0 0 0 0 0 0 0 u = 0 l = logical 0 q = 1 10 ans = "hi" 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))

J = 3×3 logical array 0 0 0 0 1 0 0 0 0 u = 0 1 0 l = 3×1 logical array 0 1 0 q = 3 3 ans = "hi" A = 1 5 8 0 6 6 ans = "hi" 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))

J = 6×1 logical array 0 0 0 1 0 1 u = 0 0 0 1 0 1 l = 6×1 logical array 0 0 0 1 0 1 q = 6 1 A = 1 3 6 NaN 3 ans = "hi" A = 1 3 6 3 ans = "hi" ans = "hi" ans = "hi" 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))

J = 2×4 logical array 0 0 0 1 0 0 0 0 u = 1 0 l = 2×1 logical array 1 0 q = 2 4 ans = "hi" A = 3 4 2 1 B = 3 4 2 1