[LeetCode] — Climbing Stairs

This is from LeetCode question 70, Climbing Stairs. This is an entry level question for dynamic programming questions.

I have implemented Java solutions in three different approach(Naive, Top-down, Bottom-up). Time complexity is efficient in the order of Bottom-up, Top-down, and naive approach.