From 91fea2f242ed91af6217e179459811265c6bf5a0 Mon Sep 17 00:00:00 2001
From: Jagjit Singh <jagjitsingh@Jagjits-MacBook-Pro.local>
Date: Mon, 14 Oct 2019 11:59:41 +0530
Subject: [PATCH] Solution for leetCode #70

---
 .../dynamic_programming/Climbstairs.java      | 51 +++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 src/com/leetcode/dynamic_programming/Climbstairs.java

diff --git a/src/com/leetcode/dynamic_programming/Climbstairs.java b/src/com/leetcode/dynamic_programming/Climbstairs.java
new file mode 100644
index 00000000..e94c5dce
--- /dev/null
+++ b/src/com/leetcode/dynamic_programming/Climbstairs.java
@@ -0,0 +1,51 @@
+package com.jagjit.Hactoberfest;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * https://leetcode.com/problems/climbing-stairs/ Runtime: 0 ms, faster than
+ * 100.00% of Java online submissions for Climbing Stairs. Memory Usage: 33.2
+ * MB, less than 5.26% of Java online submissions for Climbing Stairs.
+ */
+public class Climbstairs {
+
+	// below the function which returns count
+	public static int countWays(int n) {
+		
+		int[] dp = new int[n];
+		if (n < 2) {
+			return 1;
+		}
+		dp[0] = 1;
+		dp[1] = 2;
+		for (int i = 2; i < n; i++) {
+			dp[i] = dp[i - 1] + dp[i - 2];
+		}
+		return dp[n - 1];
+	}
+	
+	
+	public static void main(String[] args) {
+
+		// allocating memory for 5 integers.
+
+		List<Integer> result = new ArrayList<Integer>();
+		
+		result.add(countWays(3));
+		result.add(countWays(7));
+		result.add(countWays(10));
+		result.add(countWays(26));
+		result.add(countWays(44));
+		
+		
+		for (Integer i : result) {
+			
+			//print the value of values
+			System.out.print("the Count result are :" + i + "\n");
+
+		}
+
+	}
+
+}