题解 | #斐波那契数列#

public class Solution {
      public int Fibonacci(int n) {
        if (n <= 0) {
            return 0;
        }
        if (n == 1 || n == 2) {
            return 1;
        }
        int a = 1;
        int b = 1;
        int c = 0;

        for (int i = 3; i <= n ; i++) {
            c = a + b;
            a = b;
            b = c;
        }

        return c;
    }
}