Cody

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

Solution 1602421

Submitted on 7 Aug 2018 by Shawn Neal
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))

z = 1.0e+15 * -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 y = 8

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

z = 1.0e+15 * -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 y = -1

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

z = 1.0e+15 * -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 y = 3

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

z = 1.0e+15 * -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 y = 3

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

z = 1.0e+15 * -4.5036 -4.5036 y = -1

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

z = 1.0e+15 * -4.5036 -4.5036 -4.5036 -4.5036 -4.5036 y = -7