Python 回文子字串問題

求該題目程式碼

回文子字串(Palindromic Substring):
輸入一個字串(不得有空格)，找出所有不重複的回文子字串，且依字典順序排序後，將這些回文子字串以”#”相隔印出。

範例
==============
Sample input1:
abbabcc

Sample output1:
a#abba#b#bab#bb#c#cc
==============
Sample input2:
a
Sample output2:
a
==============
Sample input3:
wandnaVision

Sample output3:
V#a#andna#d#i#isi#n#ndn#o#s#w
==============
Sample input4:
89811086

Sample output4:
0#1#11#6#8#898#9

==============
Sample input5:
2020XX0221hahah

Sample output5:
0#020#0XX0#1#2#202#20XX02#22#X#XX#a#aha#h#hah#hahah

s = input(">>>")
result = []

for i in range(1, len(s) + 1):    
    for j in range(len(s)):
        if j + i > len(s):
            break
        t = s[j:j+i]
        if t == t[::-1]:
            result.append(t)

print('#'.join(sorted(set(result))))
'''
--result
>>>abbabcc
a#abba#b#bab#bb#c#cc
'''