结对测试算法性能优化（代码层面）

flag = False
for j2 in range(len(s2[i2])):
    if s[i][j] == s2[i2][j2] and j == j2:
        t = t + 1
        flag = True
        break
if flag:
    break

if s[i][j] == s2[i2][j]:
    t = t + 1
    break

        for j in range(len(s[i])):  # 对每行用例的两两拆分进行判断，是否出现在其他行
            flag = False
            for i2 in [x for x in range(len(s2)) if s2[x] != s[i]]:  # 找同一列
                if s[i][j] == s2[i2][j]:
                    t = t + 1
                    flag = True
                    break
            if not flag:  # 同一列没找到，不用找剩余列了
                break

c = int(i / 10)
jd = '\r %2d%% [%s%s]'
a = '■' * c
b = '□' * (10 - c)
print(jd % (i, a, b), end='')

c = int(i / 10)
jd = '\r %2d%% [%s%s]'
a = '■' * c
b = '□' * (10 - c)
sys.stdout.write(jd % (i, a, b))
sys.stdout.flush()