zoukankan      html  css  js  c++  java
  • 【leetcode】509. Fibonacci Number

    题目如下:

    The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

    F(0) = 0,   F(1) = 1
    F(N) = F(N - 1) + F(N - 2), for N > 1.
    

    Given N, calculate F(N).

    Example 1:

    Input: 2
    Output: 1
    Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
    

    Example 2:

    Input: 3
    Output: 2
    Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
    

    Example 3:

    Input: 4
    Output: 3
    Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
    

    Note:

    0 ≤ N ≤ 30.

    解题思路:递归的经典例子,当然为了提高效率,可以缓存中间结果。这题好像以前是Premium的,最近解锁了。

    代码如下:

    class Solution(object):
        def fib(self, N):
            """
            :type N: int
            :rtype: int
            """
            if N == 0 or N == 1:
                return N
            return self.fib(N-1) + self.fib(N-2)
            
  • 相关阅读:
    IOS开发--网络篇-->GCD(Grand Central Dispatch)的详解
    drf viewset
    12.6 drf 结构化组建
    12.5
    12.4
    12.3
    12.2
    12.1 angular vue react web前端三大主流框架的对比
    11.30
    11.28 过滤器的相关操作
  • 原文地址:https://www.cnblogs.com/seyjs/p/10383202.html
Copyright © 2011-2022 走看看