Create a __moreZeros__ function which will __receive a string__ for input, and __return an array__ (or null terminated string in C) containing only the characters from that string whose __binary representation of its ASCII value__ consists of _more zeros than ones_. 
You should __remove any duplicate characters__, keeping the __first occurence__ of any such duplicates, so they are in the __same order__ in the final array as they first appeared in the input string.
Examples
All input will be valid strings of length > 0. Leading zeros in binary should not be counted.
def more_zeros(s):
    L=[]
    L1=[]
    L2=[]
    for i in s:
        a=int(' '.join(format(ord(x), 'b') for x in i))
        for j in str(a):
            if j=="0":
                L1.append(j)
            else:
                L2.append(j)
        if len(L1)>len(L2):
            if i not in L:
                L.append(str(i))
        L1=[]
        L2=[]
    return L
def more_zeros(s):
    L=[]
    L1=[]
    L2=[]
    for i in s:
        a=int(' '.join(format(ord(x), 'b') for x in i))
        for j in str(a):
            if j=="0":
                L1.append(j)
            else:
                L2.append(j)
        if len(L1)>len(L2):
            if i not in L:
                L.append(str(i))
        L1=[]
        L2=[]
    return L