Cody

# Problem 16. Return the largest number that is adjacent to a zero

Solution 1297292

Submitted on 18 Oct 2017 by Alexis Marchesi
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, 3, 0, 2, 7, 0, 8, 9, 1 0]; b = 8; assert(isequal(nearZero(a),b))

k = -100 m = -100 n = 11 x = -100 1 5 3 0 2 7 0 8 9 1 0 -100 k = 2 m = 2 m = 3 k = 8 m = 8

2   Pass
a = [5 4 -1 0 -2 0 -5 8]; b = -1; assert(isequal(nearZero(a),b));

k = -100 m = -100 n = 8 x = -100 5 4 -1 0 -2 0 -5 8 -100 k = -2 m = -2 m = -1 k = -5

3   Pass
a = [0 3 1 0 2 9]; b = 3; assert(isequal(nearZero(a),b));

k = -100 m = -100 n = 6 x = -100 0 3 1 0 2 9 -100 k = 3 m = 3 k = 2

4   Pass
a = [1 0 2 0 3]; b = 3; assert(isequal(nearZero(a),b));

k = -100 m = -100 n = 5 x = -100 1 0 2 0 3 -100 k = 2 m = 2 k = 3 m = 3

5   Pass
a = [0 -1]; b = -1; assert(isequal(nearZero(a),b));

k = -100 m = -100 n = 2 x = -100 0 -1 -100 k = -1 m = -1

6   Pass
a = [0 -12 0 -7 0]; b = -7; assert(isequal(nearZero(a),b));

k = -100 m = -100 n = 5 x = -100 0 -12 0 -7 0 -100 k = -12 m = -12 k = -7 m = -7