Problem 15. Find the longest sequence of 1's in a binary sequence.

noice

cool

function y = lengthOnes(x)
y = double(x == '1');
L = numel(y);
A = tril(ones(L,L));
C = mat2cell(A,ones(1,L),L);
D = cellfun(@(c) conv(c,y),C,"UniformOutput",false);
E = cellfun(@(c) sum(c),C);
F = cellfun(@(c) max(c),D);
R = max(E(F == E));
if(isempty(R))
y = 0;
else
y = R;
end
end

function y = lengthOnes(x)
cnt=0;
a=[];
L=strlength(x);
for i=1:L
if x(i)=='1'
cnt=cnt+1;
else
cnt=0;
end
a(i)=cnt;
end
[y,index]=max(a);
end

Excellent work man :)

They are characters not doubles!

function y = lengthOnes(x)
a = [];
idx = [1,find(x=='0') + 1,length(x)+2];
le = length(idx);
a(1:le-1) = idx(2:le)-idx(1:le-1)-1;
y = max(a);
end

no regexp is needed actually

Cool

Solved on iPhone

@Martin solved on Nokia X2-02

Any suggestions on how to improve more ?

How can i improve the code?

a=regexp(x,'0+','split')
a=a{max(length(a))}
y=length(a)
With this code, every test passes except 4th one. Why is it so?

any way of improving this algorithm?
when y is empty vector, max(y) is not returning zero which is making my code complicated

It runs well in my Matlab program.

How much time it takes in your MATLAB? There is a limit of 50 seconds for Cody

Aditya Jain
Do you have a source for that time limit info?

probably the most inefficient code ever written :)

I'm loving it

efficient idea

cool!

I know it's not very efficient, but I sort of liked an idea behind this loop. Hence shared.

Great solution that's easy to understand adn translatable to future use.

extremely unfamiliar with "regexp" function results in a extremely stupid code...

hmmmmm.... ;-) nice

finally a proper use of regexp in Cody

can you explain your code?