Commitdda712c

authored

Merge pull requestTheAlgorithms#709 from HeikoAlexanderWeber/bug/708,fixTheAlgorithms#708

TheAlgorithms#708 (bugfix for fibonacci sequence function)

2 parents2b3e82f +1031cfb commitdda712cCopy full SHA for dda712c

File tree

-8

lines changed

-8

lines changed

Lines changed: 8 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -17,8 +17,9 @@ public static void main(String[] args) throws Exception {`
`17`	`17`	`BufferedReaderbr =newBufferedReader(newInputStreamReader(System.in));`
`18`	`18`	`intn =Integer.parseInt(br.readLine());`
`19`	`19`
`20`		`-System.out.println(fibMemo(n));// Returns 8 for n = 6`
`21`		`-System.out.println(fibBotUp(n));// Returns 8 for n = 6`
	`20`	`+// Methods all returning [0, 1, 1, 2, 3, 5, ...] for n = [0, 1, 2, 3, 4, 5, ...]`
	`21`	`+System.out.println(fibMemo(n));`
	`22`	`+System.out.println(fibBotUp(n));`
`22`	`23`	`}`
`23`	`24`
`24`	`25`	`/**`
`@@ -34,13 +35,12 @@ private static int fibMemo(int n) {`
`34`	`35`
`35`	`36`	`intf;`
`36`	`37`
`37`		`-if (n <=2) {`
`38`		`-f =1;`
	`38`	`+if (n <=1) {`
	`39`	`+f =n;`
`39`	`40`	`}else {`
`40`	`41`	`f =fibMemo(n -1) +fibMemo(n -2);`
`41`	`42`	`map.put(n,f);`
`42`	`43`	`}`
`43`		`-`
`44`	`44`	`returnf;`
`45`	`45`	`}`
`46`	`46`
`@@ -54,10 +54,10 @@ private static int fibBotUp(int n) {`
`54`	`54`
`55`	`55`	`Map<Integer,Integer>fib =newHashMap<>();`
`56`	`56`
`57`		`-for (inti =1;i <n +1;i++) {`
	`57`	`+for (inti =0;i <=n;i++) {`
`58`	`58`	`intf;`
`59`		`-if (i <=2) {`
`60`		`-f =1;`
	`59`	`+if (i <=1) {`
	`60`	`+f =i;`
`61`	`61`	`}else {`
`62`	`62`	`f =fib.get(i -1) +fib.get(i -2);`
`63`	`63`	`}`

Comments

(0)