leetcode
keep_humble
段位升级中....
展开
-
斐波那契序列、爬楼梯
1.斐波那契序列 # 斐波那契序列,对于第一项和第二项为1,其余项等于前两项之和; class Solution: def Fib(self, n): if n <= 2: return 1 else: return self.Fib(n - 1) + self.Fib(n - 2) n = int(input('请输入n的数值:')) t = Solution() for i in range(1, n+1)原创 2021-05-07 08:55:33 · 191 阅读 · 1 评论 -
leetcode实战1(x的平方根、数字反转、回文数、去除有序数组内的重复元素)
1. x的平方根 class Solution(object): def mySqrt(self, x): x1 = x rtype = 0 if x1 == 0: rtype = 0 elif x1 == 1: rtype = 1 else: # 开头 l = 0 # 结尾原创 2021-04-14 22:15:16 · 87 阅读 · 0 评论