Removing a list element that repeats itself -- Solved

[Arman777]

I have an array that looks like

A=[0,0,1,1,2,5,6,3,7,7,0,0,1,1,2,5,6,3,7,7]

since the "0,0,1,1,2,5,6,3,7,7" part reapeats itself I don't need the second part so for a given array it should give me

A=[0,0,1,1,2,5,6,3,7,7]

I can't use the set() function and I don't know what else I can use in this case.Is there a function which can do this operation ?

I tried to write a code but I couldnt

 

[anorlunda]

Your problem statement seems ill defined. How long must the sequence be before you remove it? In your example, "0" is repeated 4 times.

 

[Arman777]

oh umm I solved it..but thanks

 

[jim mcnamara]

@Arman777 Can you share your solution so others can benefit?

 

[Arman777]

@Arman777 Can you share your solution so others can benefit?

def check_repeat(l):
    for i in range(1,len(l)//2+1):
        pattern=l[:i]
        sub_lists=create_sublists(l, i, True)
        if all([x==pattern for x in sub_lists]):
            print("Found pattern {} with length {}".format(pattern, i))
            return patterndef create_sublists(l, n, only_full=False):
    sub_lists=[]
    for j in range(n, len(l),n):
        if only_full and len(l[j:j+n])<n:
            continue
        sub_lists.append(l[j:j+n])
    return sub_lists

but I didnt write it myself. Someone helped me