Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
A = [1 2; 3 4]; L = logical(eye(2));
S_correct = [1 4];
assert(isequal(columnwise_logical_sums(A, L), S_correct))
|
2 | Pass |
%%
A = triu(ones(3)); L = logical(triu(ones(3)));
S_correct = 1:3;
assert(isequal(columnwise_logical_sums(A, L), S_correct))
|
3 | Pass |
%%
A = repmat(1:3, 3, 1); L = [false(3,1) true(3,2)];
S_correct = [0 6 9];
assert(isequal(columnwise_logical_sums(A, L), S_correct))
|
4 | Pass |
%%
A = 1:5; L = logical([0 1 0 1 0]);
S_correct = [0 2 0 4 0];
assert(isequal(columnwise_logical_sums(A, L), S_correct))
|
5 | Pass |
%%
A = (1:5).'*(1:5); L = logical(diag(ones(1,4),-1));
S_correct = [2 6 12 20 0];
assert(isequal(columnwise_logical_sums(A, L), S_correct))
|
Find the longest sequence of 1's in a binary sequence.
2440 Solvers
583 Solvers
265 Solvers
2091 Solvers
377 Solvers