通过提供的数组同顺序对比取得与原所有数组不重复的数学

根据您提供的数组，我理解为您想要获取所有数组中不重复的数字，并按照提供的顺序排列。以下是我编写的 Python 代码，可以实现您的需求：

A = [1,3,4,5,8,10,12,13,14,16,17,20,21,25,26,28]
B = [1,3,4,7,11,12,15,16,19,20,22,24,28,31,32]
C = [2,7,10,13,15,16,19,20,22,25,26,28,29,31,33]
D = [1,2,3,5,8,10,14,15,17,25,26,29,33]
E = [3,5,8,11,12,15,19,21,24,26,30,31,33]
F = [3,6,8,10,12,14,15,17,20,21,29,31]
G = [3,4,7,12,14,16,19,21,25,28,29,31]
H = [4,6,10,11,12,18,19,20,22,25,26,31]
I = [1,3,7,8,9,15,16,21,22,23,28,30,33]
J = [1,6,8,9,14,17,18,22,24,26,27,31,33]
K = [1,3,4,7,12,13,15,16,18,19,20,32,33]
L = [1,6,10,11,12,15,17,18,19,22,32,33]
M = [1,7,11,13,19,20,21,22,26,27,28,32]
N = [2,6,8,10,13,17,18,20,24,25,27,29]
O = [1,2,6,10,11,12,17,18,25,28,31,33]
P = [4,6,7,14,20,21,22,25,29,30,31,32]
R = [1,2,7,9,11,14,16,26,29,30,33]
S = [1,3,5,7,9,15,16,21,25,28,29]
T = [1,2,7,9,11,14,16,26,29,30,33]
U = [1,3,5,7,9,15,16,21,25,28,29]
V = [5,7,10,14,16,18,20,21,22,26,28]
W = [4,7,10,11,13,14,16,17,20,21,33]
X = [3,4,6,14,17,19,29,31,33]
Y = [1,2,7,8,12,15,17,19,22,28,33]
Z = [2,4,11,14,15,21,24,25,29,32,33]
a = [1,6,10,11,12,18,19,26,27,28,29]
b = [1,5,6,16,17,20,21,22,23,24]
c = [6,7,11,14,15,17,23,27,28,30,33]
d = [4,5,9,12,14,15,18,19,25,26,33]
e = [1,3,4,6,8,10,13,15,23,27,30,31]
f = [1,3,4,8,10,13,15,23,27,28,30,31]
g = [3,9,10,20,21,25,28,29,31,32]
h = [7,8,10,15,19,22,28,31]
i = [1,3,5,9,10,11,13,17,22,26,28]
j = [2,3,9,12,18,21,26,31,32]

# 将所有数组合并成一个列表
all_numbers = A + B + C + D + E + F + G + H + I + J + K + L + M + N + O + P + R + S + T + U + V + W + X + Y + Z + a + b + c + d + e + f + g + h + i + j

# 创建一个空列表，用于存储不重复的数字
unique_numbers = []

# 遍历所有数字，将不重复的数字添加到 unique_numbers 列表中
for num in all_numbers:
    if num not in unique_numbers:
        unique_numbers.append(num)

# 按照提供的顺序排列数字
result = [num for num in unique_numbers if num in A+B+C+D+E+F+G+H+I+J+K+L+M+N+O+P+R+S+T+U+V+W+X+Y+Z+a+b+c+d+e+f+g+h+i+j]

print(result)

运行代码后，输出的 `result` 列表即为所有不重复数字按照提供的顺序排列的结果。