Cody

Problem 658. Find the biggest empty box

Solution 110110

Submitted on 11 Jul 2012 by Aurelien Queffurust
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
%% a = [1 0; 0 0]; [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 1; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

varargout = [2] [2] [1] [1]

2   Pass
%% a = [1 0 0; 0 0 0; 0 0 0]; [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 2; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

varargout = [2] [2] [1] [1] varargout = [2] [3] [1] [2]

3   Pass
%% a = eye(9); [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 4; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

varargout = [2] [2] [1] [1] varargout = [3] [4] [1] [2] varargout = [4] [6] [1] [3] varargout = [5] [8] [1] [4]

4   Pass
%% a = double(magic(7)<6); [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 4; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

varargout = [1] [1] [1] [1] varargout = [1] [2] [1] [2] varargout = [1] [3] [1] [3] varargout = [2] [5] [2] [5]

Suggested Problems

More from this Author49