3.对称子字符串

Description
Given a string ‘str’ of digits, find length of the longest substring of ‘str’, such that the length of the substring is 2k digits and sum of left k digits is equal to the sum of right k digits.

Input
输入第一行是测试用例的个数，后面每一行表示一个数字组成的字符串，例如：“123123”

Output
输出找到的满足要求的最长子串的长度。例如，给定的例子长度应该是 6。每行对应一个用例的结果。

Sample Input 1
1
1538023

Sample Output 1
4

def solution(l):
    if len(l) <= 1:
        return 0
    else:
        res = 0
        for i in range(1, len(l)):
            step = 1
            while i - step >= 0 and i + step - 1 < len(l):
                if sum(l[i-step:i]) == sum(l[i:i+step]) and step > res:
                    res = step
                step += 1
        return res * 2
    

if __name__ == '__main__':
    n = int(input())
    for i in range(n):
        l = list(map(int, input()))
        result = solution(l)
        print(result)