整理面试的基础动态规划相关试题

1.小米面试题之爬楼梯：如果是整数会溢出，因此用BigInteger，用递归也会超时，所以用斐波那契数列

import java.util.Scanner;
import java.math.BigInteger;

public class Main {
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
if (n<=1){
System.out.println(n);
}else{
BigInteger[] fibonacci = new BigInteger[n];
fibonacci[0] = BigInteger.valueOf(1);
fibonacci[1] = BigInteger.valueOf(1);
for(int i=2; i<n; i++) {
fibonacci[i] = fibonacci[i-1].add(fibonacci[i-2]);
}
System.out.println(fibonacci[n-1].add(fibonacci[n-2]));
}

}

}