My Blog List

[Leetcode Solution] Climbing Stairs

Analysis 

  • Dynamic programming
  • f[i] = f[i-1] + f[i-2]

Note

Code


UPDATED AT LEETCODE 2ND PASS

No comments:

Post a Comment

Enter you comment