Cody

Problem 42630. Make visible max values

Solution 1587622

Submitted on 19 Jul 2018 by Rafael Hernandez-Walls
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
x = [1 2 3 4 5;6 9 8 2 1;2 1 4 5 8;1 9 7 9 2]; y_correct = [0 0 0 0 5;0 9 0 0 0;0 0 0 0 8;0 9 0 9 0]; assert(isequal(visibleMax(x),y_correct))

y = 0 0 0 0 5 0 9 0 0 0 0 0 0 0 8 0 9 0 9 0
2   Pass
x = [10 20 40 85 96 15 14 12;14 15 12 16 19 17 15 0]; y_correct = [0 0 0 0 96 0 0 0;0 0 0 0 19 0 0 0]; assert(isequal(visibleMax(x),y_correct))

y = 0 0 0 0 96 0 0 0 0 0 0 0 19 0 0 0
3   Pass
x = [2 4 9; 9 1 0; 8 4 1; 7 5 6; 4 2 1; 4 5 6; 1 9 5]; y_correct = [0 0 9;9 0 0;8 0 0;7 0 0;4 0 0;0 0 6;0 9 0]; assert(isequal(visibleMax(x),y_correct))

y = 0 0 9 9 0 0 8 0 0 7 0 0 4 0 0 0 0 6 0 9 0
4   Pass
x = [5; 8 ; 9 ; 1 ; 3 ; 4]; y_correct = [5; 8 ; 9 ; 1 ; 3 ; 4]; assert(isequal(visibleMax(x),y_correct))

y = 5 8 9 1 3 4
5   Pass
x = [2 4; Inf 1; 9 2; NaN 5]; y_correct = [0 4;Inf 0;9 0;0 5]; assert(isequal(visibleMax(x),y_correct))

y = 0 4 Inf 0 9 0 0 5

Suggested Problems

More from this Author72

Community Treasure Hunt

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

Start Hunting!