Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

#708 (bugfix for fibonacci sequence function)

Browse Source 
o fixed function "fibMemo" according to acceptance criteria in #708
o fixed function "fibBotUp" according to acceptance criteria in #708
This commit is contained in:
Heiko Alexander Weber 2019-02-26 23:10:20 +01:00
parent 2b3e82fd4c
commit 1031cfb35c
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
Dynamic Programming/Fibonacci.java
View File

@ -17,8 +17,9 @@ public class Fibonacci {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine()); int n = Integer.parseInt(br.readLine());
System.out.println(fibMemo(n)); // Returns 8 for n = 6 // Methods all returning [0, 1, 1, 2, 3, 5, ...] for n = [0, 1, 2, 3, 4, 5, ...]
System.out.println(fibBotUp(n)); // Returns 8 for n = 6 System.out.println(fibMemo(n));
System.out.println(fibBotUp(n));
} }
/** /**
@ -34,13 +35,12 @@ public class Fibonacci {
int f; int f;
if (n <= 2) { if (n <= 1) {
f = 1; f = n;
} else { } else {
f = fibMemo(n - 1) + fibMemo(n - 2); f = fibMemo(n - 1) + fibMemo(n - 2);
map.put(n, f); map.put(n, f);
} }
return f; return f;
} }
@ -54,10 +54,10 @@ public class Fibonacci {
Map<Integer, Integer> fib = new HashMap<>(); Map<Integer, Integer> fib = new HashMap<>();
for (int i = 1; i < n + 1; i++) { for (int i = 0; i <= n; i++) {
int f; int f;
if (i <= 2) { if (i <= 1) {
f = 1; f = i;
} else { } else {
f = fib.get(i - 1) + fib.get(i - 2); f = fib.get(i - 1) + fib.get(i - 2);
} }