From 43016267cb8b03abf2506a3bb8fe92fe6b0f6264 Mon Sep 17 00:00:00 2001
From: Pallavi Chugh <pallavichugh2309@gmail.com>
Date: Mon, 21 Oct 2019 09:52:29 +0000
Subject: [PATCH] DP approach for Leetcode Climbing Stairs problem

---
 #70/java/DP/ClimbingStairs.java | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 #70/java/DP/ClimbingStairs.java

diff --git a/#70/java/DP/ClimbingStairs.java b/#70/java/DP/ClimbingStairs.java
new file mode 100644
index 0000000..9159010
--- /dev/null
+++ b/#70/java/DP/ClimbingStairs.java
@@ -0,0 +1,14 @@
+class Solution {
+    public int climbStairs(int n) {
+        if(n == 0)
+            return 0;
+        int arr[] = new int[n+1];
+
+        arr[0] = 1; arr[1] = 1;
+
+        for(int i = 2; i <= n; i++){
+            arr[i] = arr[i-1] + arr[i-2];
+        }
+        return arr[n];
+    }
+}
\ No newline at end of file