Not really a solution, more like a "white flag" regarding this direction.
hint: recursion
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = [NaN 1 2 NaN 17 3 -4 NaN];
y_correct = [0 1 2 2 17 3 -4 -4];
assert(isequal(replace_nans(x),y_correct))
y =
0 1 2 2 17 3 -4 -4
|
2 | Pass |
%%
x = [NaN 1 2 NaN NaN 17 3 -4 NaN];
y_correct = [ 0 1 2 2 2 17 3 -4 -4];
assert(isequal(replace_nans(x),y_correct))
y =
0 1 2 2 2 17 3 -4 -4
|
3 | Pass |
%%
x = [NaN NaN NaN NaN];
y_correct = [ 0 0 0 0];
assert(isequal(replace_nans(x),y_correct))
y =
0 0 0 0
|
4 | Pass |
%%
x = [1:10 NaN];
y_correct = [ 1:10 10];
assert(isequal(replace_nans(x),y_correct))
y =
1 2 3 4 5 6 7 8 9 10 10
|
354 Solvers
167 Solvers
Find nearest prime number less than input number
183 Solvers
343 Solvers
264 Solvers