Python学习——leetcode(Climbing Stairs)

class Solution:
    # @param n, an integer
    # @return an integer
    def climbStairs(self, n):
		if n==0:
			return 0
		elif n==1:
			return 1
		elif n==2:
			return 2
		else:
			f1,f2=1,2
			while n-3>=0:
				f1,f2=f2,f1+f2
				n=n-1
			return f2