FilesExpand file tree

 main

/

FibonacciTopDownExample.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

21 lines (17 loc) · 509 Bytes

 main

/

FibonacciTopDownExample.java

Top

File metadata and controls

• Code
• Blame

21 lines (17 loc) · 509 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

package ch23;

class FibonacciTopDownExample {

static int[] dp = new int[100];

static public int fib(int n) {

// 0과 1인 상향식과 마찬가지로 값을 미리 지정

if (n <= 1)

return n;

// 미리 계산한 결과가 있다면 해당 값 리턴

if (dp[n] != 0)

return dp[n];

dp[n] = fib(n - 1) + fib(n - 2);

return dp[n];

}

public static void main(String[] args) {

System.out.println(fib(10));

}

}