for (int i = 0; i <= k; i++) states[i] = states[i]*p + states[i+1]*(1-p); return exp(-rate*T) * states[0];
“这里是for循环〜”
recurs(int k) { if (k > 0) recurs(k - 1); states[k] = states[k] * p + states[k + 1] * (1-p); }