Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
memfib = memoize_this(@fib);
[seq, n1] = fib(1, memfib);
assert(n1 == 1);
[seq, n2] = fib(20, memfib);
assert(n2 - n1 == 19);
[seq, n3] = fib(100, memfib);
assert(n3 - n2 == 81);
function [seq, n] = fib(n, memfib)
persistent num
if isempty(num)
num = 1;
else
num = num + 1;
end
if n < 3
seq = ones(1, n);
else
seq = memfib(n-1, memfib);
seq = [seq, seq(end-1) + seq(end)];
end
n = num;
end
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
550 Solvers
2934 Solvers
231 Solvers
308 Solvers