diff options
| -rw-r--r-- | challenge-112/ziameraj16/README.md | 30 | ||||
| -rw-r--r-- | challenge-112/ziameraj16/java/ClimbStairs.java | 18 |
2 files changed, 44 insertions, 4 deletions
diff --git a/challenge-112/ziameraj16/README.md b/challenge-112/ziameraj16/README.md index bdb0a95ebe..522cc9b303 100644 --- a/challenge-112/ziameraj16/README.md +++ b/challenge-112/ziameraj16/README.md @@ -11,17 +11,39 @@ java CanonicalPath ``` ### Example ```bash -~/study/github/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java CanonicalPath +/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java CanonicalPath Enter a string /a/ /a -~/study/github/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java CanonicalPath +/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java CanonicalPath Enter a string /a/b//c/ /a/b/c -~/study/github/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java CanonicalPath +/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java CanonicalPath Enter a string /a/b/c/../.. /a -~/study/github/perlweeklychallenge-club/challenge-112/ziameraj16/java$ +``` + +# Climb Stairs +## Java Solution + +To compile the code run +```java +javac ClimbStairs.java +``` +To run +```java +java ClimbStairs +``` +### Example +```bash +/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java ClimbStairs +Enter total number of stairs +3 +3 +/perlweeklychallenge-club/challenge-112/ziameraj16/java$ java ClimbStairs +Enter total number of stairs +4 +5 ``` diff --git a/challenge-112/ziameraj16/java/ClimbStairs.java b/challenge-112/ziameraj16/java/ClimbStairs.java new file mode 100644 index 0000000000..68d2c4327e --- /dev/null +++ b/challenge-112/ziameraj16/java/ClimbStairs.java @@ -0,0 +1,18 @@ +import java.util.Scanner; + +public class ClimbStairs { + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + System.out.println("Enter total number of stairs"); + int stepsToClimb = scanner.nextInt(); + System.out.println("Output: " + numberOfWays(stepsToClimb + 1)); + } + + public static int numberOfWays(int n) { + if (n <= 1) { + return n; + } + return numberOfWays(n -1) + numberOfWays(n - 2); + } +} |