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 |
x = [ 1 2 3 4 5 1 2 4 6];
n=3;
y_correct = [ 3 3 3 4 5 3 3 4 6];
assert(isequal(your_fcn_name(x,n),y_correct))
x =
3 2 3 4 5 1 2 4 6
x =
3 3 3 4 5 1 2 4 6
x =
3 3 3 4 5 3 2 4 6
x =
3 3 3 4 5 3 3 4 6
y =
3 3 3 4 5 3 3 4 6
|
2 | Pass |
x= [ -1 0 1 1 -100 1000 2 6];
n=1;
y_correct = [ 1 1 1 1 1 1000 2 6];
assert(isequal(your_fcn_name(x,n),y_correct))
x =
1 0 1 1 -100 1000 2 6
x =
1 1 1 1 -100 1000 2 6
x =
1 1 1 1 1 1000 2 6
y =
1 1 1 1 1 1000 2 6
|
3 | Pass |
x= [ 1 2 3 4 Inf -Inf 6];
n=3;
y_correct = [3 3 3 4 Inf 3 6];
assert(isequal(your_fcn_name(x,n),y_correct))
x =
3 2 3 4 Inf -Inf 6
x =
3 3 3 4 Inf -Inf 6
x =
3 3 3 4 Inf 3 6
y =
3 3 3 4 Inf 3 6
|
Return the largest number that is adjacent to a zero
3117 Solvers
Set the array elements whose value is 13 to 0
753 Solvers
Create a Multiplication table matrix...
226 Solvers
414 Solvers
201 Solvers