斐波那契数列

class Solution {
public:
        int Fibonacci(int n) {
         int f = 0, g = 1; 
         while (0 < n--) { g += f; f = g - f; } 
         return f; 
        }

};