题解 | #斐波那契数列#

public class Solution {
    public int Fibonacci(int n) {
        if(n==1||n==2){
            return 1;
        }
        int pre = 1;
        int cut = 1;
        int temp = 0;
        for(int i = 2 ;i < n; i++){
          temp = pre + cut;
          pre = cut;
          cut = temp;
        }
        return cut;
    }
}