基本上:def solve(numLegs, numHeads):
for numChick in range(0, numHeads + 1): #for every number in the range 0 - the number of heads + 1, numChick = that number
numPigs = numHeads - numChicks #the number of Pigs equals the number of heads entered minus the current number
totLegs = 4 * numPigs + 2* numChicks #the amount of legs is 4(amount of legs) * number of heads + 2(chicken legs) * the current number
if totLegs == numLegs: if the pigs legs + the chicken legs = the total number of legs,
return [numPigs, numChicks] #return the number of pigs and chickens
return[None, None] #else, return none, triggering "no solution"
def barnYard():
heads = int(raw_input('Enter number of heads:')) #
legs = int(raw_input('Enter number of legs:'))
pigs, chickens = solve(legs, heads)
if pigs = None:
print 'there is no solution'
else:
print 'number of pigs:' , pigs
pirnt 'number of chickes:', chickens
所以:
基本上,它会一遍又一遍地运行函数,直到计算出的腿数等于输入的腿总数。如果它永远不等于,它只会返回[无,无]。(return[numPigs,numChicks]中断for循环)
编辑:
我试着把2号线的+1去掉,结果还是很好。