算法描述:将1-9放入9个盒子中,使其满足XXX + XXX = XXX,请问有多少种情况(去重)?
算法实现:采用了dfs的核心思想
a = [0] * 9
book = [0] * 9
TOTAL = 0
def dfs(step):
if (step == len(a)):
con1 = a[0] * 100 + a[1] * 10 + a[2]
con2 = a[3] * 100 + a[4] *
算法描述:将1-9放入9个盒子中,使其满足XXX + XXX = XXX,请问有多少种情况(去重)?
算法实现:采用了dfs的核心思想
a = [0] * 9
book = [0] * 9
TOTAL = 0
def dfs(step):
if (step == len(a)):
con1 = a[0] * 100 + a[1] * 10 + a[2]
con2 = a[3] * 100 + a[4] *