1 | |
package com.dvp.tutoriel.fibonacci; |
2 | |
|
3 | |
import java.util.HashMap; |
4 | |
import java.util.Map; |
5 | |
|
6 | 2 | public class FibonacciDao { |
7 | |
|
8 | |
public Map<Integer, Long> charger() { |
9 | 2 | final Map<Integer, Long> map = new HashMap<Integer, Long>(); |
10 | |
|
11 | |
|
12 | |
|
13 | |
|
14 | |
|
15 | |
|
16 | 2 | map.putAll(bouchon()); |
17 | |
|
18 | 2 | return map; |
19 | |
} |
20 | |
|
21 | |
private Map<Integer, Long> bouchon() { |
22 | 2 | final Map<Integer, Long> map = new HashMap<Integer, Long>(); |
23 | |
|
24 | 2 | map.put(1, 1L); |
25 | 2 | map.put(2, 1L); |
26 | 2 | map.put(3, 2L); |
27 | 2 | map.put(4, 3L); |
28 | 2 | map.put(5, 5L); |
29 | 2 | map.put(6, 8L); |
30 | 2 | map.put(7, 13L); |
31 | 2 | map.put(8, 21L); |
32 | 2 | map.put(9, 34L); |
33 | 2 | map.put(10, 55L); |
34 | 2 | map.put(11, 89L); |
35 | 2 | map.put(12, 144L); |
36 | 2 | map.put(13, 233L); |
37 | 2 | map.put(14, 377L); |
38 | 2 | map.put(15, 610L); |
39 | 2 | map.put(16, 987L); |
40 | 2 | map.put(17, 1597L); |
41 | 2 | map.put(18, 2584L); |
42 | 2 | map.put(19, 4181L); |
43 | 2 | map.put(20, 6765L); |
44 | 2 | map.put(21, 10946L); |
45 | 2 | map.put(22, 17711L); |
46 | 2 | map.put(23, 28657L); |
47 | 2 | map.put(24, 46368L); |
48 | 2 | map.put(25, 75025L); |
49 | 2 | map.put(26, 121393L); |
50 | 2 | map.put(27, 196418L); |
51 | 2 | map.put(28, 317811L); |
52 | 2 | map.put(29, 514229L); |
53 | 2 | map.put(30, 832040L); |
54 | 2 | map.put(31, 1346269L); |
55 | 2 | map.put(32, 2178309L); |
56 | 2 | map.put(33, 3524578L); |
57 | 2 | map.put(34, 5702887L); |
58 | 2 | map.put(35, 9227465L); |
59 | 2 | map.put(36, 14930352L); |
60 | 2 | map.put(37, 24157817L); |
61 | 2 | map.put(38, 39088169L); |
62 | 2 | map.put(39, 63245986L); |
63 | 2 | map.put(40, 102334155L); |
64 | |
|
65 | 2 | return map; |
66 | |
} |
67 | |
|
68 | |
} |