Rename 0:1 Knapsack (Dynamic Programming) to Dynamic Programming

Add 70_Climbing_Stairs.java

Author: Sean Prashad

0:1 Knapsack (Dynamic Programming)/.gitkeep

@@ -0,0 +1,17 @@
+class Solution {
+ public int climbStairs(int n) {
+ if (n < 2) {
+ return n;
+ }
+
+ int[] dp = new int[n];
+ 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];
+ }
+}