蓝桥杯 算法提高 ADV-1184 最小字符串 python AC

t = int(input())
for _ in range(t):
    ll = []
    n = int(input())
    for _ in range(n):
        now = input()
        for i in range(len(ll)):
            if now + ll[i] < ll[i] + now:
                ll.insert(i, now)
                break
        else:
            ll.append(now)
    print(''.join(ll))

每次输入字符串时对字符串插入位置进行判断