根據波峰波谷轉化成010的二進制格式“110011011011001100001110011111110111010111011000010101110101010110011011101011101110110111011110011111101”
然后你會發現他的位數不夠在每組前面+0然后轉化為ASCII碼

l='110011011011001100001110011111110111010111011000010101110101010110011011101011101110110111011110011111101'
h=[]
j=''
for i in range(0,len(l),7):
    h.append('0'+l[i:i+7])
for g in h :
    j+=chr(int(g,2))
print(j)