Java 动态规划斐波那契

我需要用动态数组dp做Fibonacci。如果未设置任何值，则存在双负无穷大。问题是，结果是错误的，我不知道为什么

公共静态双成员DP（int n）{

if（dp[n]！=Double.NEGATIVE_无穷大）{
返回dp[n]；
}
如果（n在不知道“斐波那契”的确切定义的情况下，怀疑
-c
部分是错误的。删除它后，我会得到“有意义的”结果

及

结果：

0:  0.0
1:  1.0
2:  2.0
3:  3.0
4:  6.5
5:  19.25
6:  35.375
7:  107.6875
8:  196.90625
9:  599.953125
10: 1096.8359375
11: 3342.04296875
12: 6109.900390625
13: 18616.7939453125
14: 34035.09130859375
15: 103704.52221679688
16: 189591.87463378906
17: 577684.2088012695
18: 1056118.1878356934
19: 3217979.678390503
20: 5883087.705421448

对于什么输入，你得到了错误的结果？你得到了什么结果？它应该是什么？请不要让我们猜测。我假设你有
a=1
，
b=1
和
c=2
从中得到斐波那契数。斐波那契是一个整数序列。如果
a
an，为什么要使用Double？@slim它们不是整数d
b
不是整数。这是斐波那契的一些奇怪的推广。@slim似乎n实际上是整数，dp[n]和a，b可能是非整数汉克斯：）我太盲目了，看不到正确的答案^^
    c = 4;
    a = 1.5;
    b = 2.5;
    initDP(50);
    for ( int i = 0; i < 50; i++ ){
        System.out.println(i + ":\t" + memberDP(i));


    0: 0.0
    1:  1.0

    2:  2.0
    3:  -1.0
    4:  -0.5
    5:  2.25
    6:  2.375
    7:  -1.6875
    8:  -0.28125
    9:  2.515625
    10: 2.0859375
    11: -1.32421875
    12: 0.529296875
    13: 1.8212890625
    14: 1.40771484375
    15: -0.174560546875
    16: 1.5594482421875
    17: 0.62799072265625
    18: 0.767425537109375
    19: 1.1757354736328125
    20: 2.3915939331054688
    21: -0.4283714294433594
    22: 0.5331783294677734
    23: 2.125004768371582
    24: 2.7591357231140137
    25: -0.8463895320892334
    26: 0.8554204702377319
    27: 2.3314254879951477
    28: 2.650748699903488
    29: -0.46995387971401215
    30: 1.6264946684241295
    31: 1.8375013656914234
    32: 2.286298168823123
    33: 0.483345584012568
    34: 2.5625197417102754
    35: 1.0050382979679853
    36: 1.990903030964546
    37: 1.5670682262280025
    38: 3.355640637309989
    39: 0.3130827123095514
    40: 2.0366922946923296
    41: 2.337294489963824
    42: 3.8190244472552877
    43: 0.12718007106468576
    44: 2.528064596560853
    45: 2.5549921489748613
    46: 3.9596682945269777
    47: 0.548230449297364
    48: 3.3773378229209072
    49: 2.270999383066524
    */

dp[n] = a * memberDP(n - 1) + memberDP(n - 2); // - 2 instead of - c

dp[n] = b * memberDP(n - 1) + memberDP(n - 2); // - 2 instead of - c

0:  0.0
1:  1.0
2:  2.0
3:  3.0
4:  6.5
5:  19.25
6:  35.375
7:  107.6875
8:  196.90625
9:  599.953125
10: 1096.8359375
11: 3342.04296875
12: 6109.900390625
13: 18616.7939453125
14: 34035.09130859375
15: 103704.52221679688
16: 189591.87463378906
17: 577684.2088012695
18: 1056118.1878356934
19: 3217979.678390503
20: 5883087.705421448