我今天刚学python,所以天真地想着写一段关于递归的代码。 那么我们如何在Python中实现以下功能呢?
class mine:
def inclass(self):
self = mine();
def recur(num):
print(num, end="")
if num > 1:
print(" * ",end="")
return num * self.recur(num-1)
print(" =")
return 1
def main():
a = mine()
print(mine.recur(10))
main()
我试图定义自我,但想不出办法。有什么建议吗? 非常感谢。
是的,接下来的工作,谢谢。
class mine:
def recur(self, num):
print(num, end="")
if num > 1:
print(" * ",end="")
return num * self.recur(self, num-1)
print(" =")
return 1
def main():
a = mine()
print(mine.recur(mine, 10))
main()
类的每个方法都必须有
self
作为第一个参数,即执行以下操作:
def recur(self, num):
现在应该可以工作了。
基本上,幕后发生的事情就是当你这样做时
instance.method(arg1, arg2, arg3, ...)
Python 可以
Class.method(instance, arg1, arg2, arg3, ....)
这是一个实际有效的代码示例
class Card():
def __init__(self,cardsPlayedList,cardPosition):
self.cardsPlayedList = cardsPlayedList
self.cardPosition = cardPosition
# self.cardPosition
def getNewCard(self,cardPosition):
cardNum = 0
cardInList = False
cardNum = random.randint(1,len(cardList)-1) # Get random card from List - 1 to 52
for x in self.cardsPlayedList:
if(cardNum == x):
cardInList = True
if(cardInList == False):
self.cardsPlayedList.insert(self.cardPosition, cardNum) # if card not already played then store in list
return cardNum
else:
return self.getNewCard(cardPosition)
# USING FUNCTION
def function_recursion(number):
if number <= 1:
return number
else:
return (number + function_recursion(number - 1))
result = function_recursion(5)
print("function recursion: ", result)
#USING CLASS
class Recursion:
def __init__(self, number):
self.number = number
def recur(self):
if self.number <= 1:
return True
else:
return (self.number + self.recur(self.number - 1))
result = Recursion(3)
print("Recursion using class: ", result.recur())