python两数交换代码_python：两个数组之间交换元素的算法

我不确定我是否正确地理解了你的想法。我的理解是：def counting(A, m):

n = len(A)

count = [0] * (m + 1)

for k in xrange(n):

count[A[k]] += 1

return count # this essentially build a counter

def fast_solution(A, B, m):

n = len(A)

sum_a = sum(A)

sum_b = sum(B)

d = sum_b - sum_a

if d % 2 == 1:

return False

d //= 2

count = counting(A, m) # get the dict

for i in xrange(n):

if 0 <= B[i] - d and B[i] - d <= m and count[B[i] - d] > 0:

# the first two conditions are to verify that B[i]-d exists as a key (index) in counter.

# then check if there actually exists the value.

# if count > 0, then you can swap the two to get same sum

return True

return False

或重写以获得：

^{pr2}$

但是在任何情况下，这段代码只需检查解决方案是否存在，一定要检查是否这是您想要的。在