Cody

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

Solution 694219

Submitted on 30 Jun 2015 by Mark Orloff
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))

p = 2 p = 3 c = 3 p = 4 c = 3 2 c = 3 2 3 p = 5 c = 3 2 3 2 p = 6 c = 3 2 3 2 7 p = 7 c = 3 2 3 2 7 8 c = 3 2 3 2 7 8 7 p = 8 c = 3 2 3 2 7 8 7 8 p = 9 p = 10 c = 3 2 3 2 7 8 7 8 1 b = 8

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

p = 2 p = 3 c = -1 p = 4 c = -1 -2 c = -1 -2 -1 p = 5 c = -1 -2 -1 -2 c = -1 -2 -1 -2 -2 p = 6 c = -1 -2 -1 -2 -2 -5 c = -1 -2 -1 -2 -2 -5 -2 p = 7 c = -1 -2 -1 -2 -2 -5 -2 -5 b = -1

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

p = 2 c = 3 p = 3 c = 3 1 p = 4 c = 3 1 2 c = 3 1 2 1 p = 5 c = 3 1 2 1 2 b = 3

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

p = 2 c = 2 c = 2 1 p = 3 c = 2 1 2 c = 2 1 2 2 p = 4 c = 2 1 2 2 3 c = 2 1 2 2 3 2 b = 3

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

b = -1

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

p = 2 c = -12 c = -12 -12 p = 3 c = -12 -12 -7 c = -12 -12 -7 -12 p = 4 c = -12 -12 -7 -12 -7 c = -12 -12 -7 -12 -7 -7 b = -7