Leetcode509. Fibonacci Number

斐波那契数，通常用 F(n) 表示，形成的序列称为斐波那契数列。该数列由 0 和 1 开始，后面的每一项数字都是前面两项数字的和。也就是：

F(0) = 0, F(1) = 1 F(N) = F(N - 1) + F(N - 2), 其中 N > 1. 给定 N，计算
F(N)。

示例 1：

输入：2 输出：1 解释：F(2) = F(1) + F(0) = 1 + 0 = 1. 示例 2：

输入：3 输出：2 解释：F(3) = F(2) + F(1) = 1 + 1 = 2. 示例 3：

输入：4 输出：3 解释：F(4) = F(3) + F(2) = 2 + 1 = 3.

提示：

0 ≤ N ≤ 30

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/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.

刚好碰到，顺手做了，0ms

class Solution {
public:
    int fib(int N) {
        if(N<2) return N;
        int temp1=0,temp2=1,val;
        for(int i=2;i<=N;++i){
            val=temp2+temp1;
            temp1=temp2;
            temp2=val;
        }
        return temp2;
    }
};