力扣刷题笔记（70）

#include

int climbStairs(int n)
{
	int arr[204800] = {0};
	arr[1] = 1;
	arr[2] = 2;
	
	if(n == 1 || n == 2)
	{
		return arr[n];
	}
	int i = 3;
	for(; i < n+1 ; i++)
	{	
		arr[i] = arr[i-1] + arr[i-2];
	}
	return arr[i-1];
}

int main()
{
	int result = climbStairs(45);
	printf("%dn", result);
}