Leetcode Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Difficulty: Easy

public class Solution {    public int climbStairs(int n) {        if(n == 1) return 1;        int[] nums = new int[n];        nums[0] = 1;        nums[1] = 2;        for(int i = 2; i < n; i++){            nums[i] = nums[i-1] + nums[i-2];        }        return nums[n-1];    }}