leetcode 70 Climbing Stairs C++

这个是斐波纳切竖列

class Solution {public:    int climbStairs(int n) {        int num1 = 0;        int num2 = 1;        for (int i = 0;i<n; i++){            int tmp = num2;            num2 = num1 + num2;            num1 = tmp;        }        return num2;    }};