Cody

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

Solution 1401895

Submitted on 2 Jan 2018 by Bailey Horton
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))

n = 11 base = 0 A = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A = 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A = 0 0 0 0 0 0 3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A = 0 0 0 0 0 0 3 2 0 0 0 0 7 0 0 0 0 0 0 0 0 0 A = 0 0 0 0 0 0 3 2 0 0 0 0 7 8 0 0 0 0 0 0 0 0 A = 0 0 0 0 0 0 3 2 0 0 0 0 7 8 0 0 0 0 0 0 1 0 ydouble = 7 8 y = 8

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

n = 8 base = -5 A = -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 -5 A = -5 -5 -5 -5 -5 -5 -1 -5 -5 -5 -5 -5 -5 -5 -5 -5 A = -5 -5 -5 -5 -5 -5 -1 -2 -5 -5 -5 -5 -5 -5 -5 -5 A = -5 -5 -5 -5 -5 -5 -1 -2 -5 -5 -2 -5 -5 -5 -5 -5 A = -5 -5 -5 -5 -5 -5 -1 -2 -5 -5 -2 -5 -5 -5 -5 -5 ydouble = -1 -2 y = -1

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

n = 6 base = 0 A = 0 0 0 0 0 0 0 0 0 0 0 0 A = 0 3 0 0 0 0 0 0 0 0 0 0 A = 0 3 0 0 0 0 1 0 0 0 0 0 A = 0 3 0 0 0 0 1 2 0 0 0 0 ydouble = 1 3 y = 3

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

n = 5 base = 0 A = 0 0 0 0 0 0 0 0 0 0 A = 0 0 1 0 0 0 0 0 0 0 A = 0 0 1 2 0 0 0 0 0 0 A = 0 0 1 2 0 0 2 0 0 0 A = 0 0 1 2 0 0 2 3 0 0 ydouble = 2 3 y = 3

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

n = 2 base = -1 A = -1 -1 -1 -1 A = -1 -1 -1 -1 ydouble = -1 -1 y = -1

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

n = 5 base = -12 A = -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 A = -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 A = -12 -12 -12 -12 -12 -12 -12 -12 -12 -12 A = -12 -12 -12 -12 -12 -7 -12 -12 -12 -12 A = -12 -12 -12 -12 -12 -7 -12 -12 -7 -12 ydouble = -7 -7 y = -7

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!