递归实现pow内建函数和欧几里德算法

1、用递归实现内建函数pow

class Solution(object):
def __init__(self):
pass
def power(self,x,y):
if y == 0:
return 1
elif y == 1:
return x
else:
return x*(self.power(x,y-1))

if __name__ == '__main__':
Test = Solution()
print(Test.power(2,5))
print(Test.power(10,3))
print(Test.power(-2,3))
print(Test.power(2,0))



2、欧几里德算法：辗转相除求余

class Solution(object):
def __init__(self):
pass
def gcd(self,x,y):
if y == 0:
return x
else:
return self.gcd(y,x%y)

Test = Solution()
print(Test.gcd(36,24))
print(Test.gcd(10,7))