用delphi Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:F1=0 (n=1) F2=1 (n=2) Fn=Fn-1Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:\x05\x05F1=0 (n=1)\x05\x05F2=1 (n=2)\x05\x05Fn=Fn-1+Fn-2 (n≥3)\x0
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/28 13:38:00
![用delphi Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:F1=0 (n=1) F2=1 (n=2) Fn=Fn-1Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:\x05\x05F1=0 (n=1)\x05\x05F2=1 (n=2)\x05\x05Fn=Fn-1+Fn-2 (n≥3)\x0](/uploads/image/z/693072-0-2.jpg?t=%E7%94%A8delphi+Fibonacci%E6%95%B0%E5%88%97%2C%E5%89%8D%E5%87%A0%E4%B8%AA%E6%95%B0%E4%B8%BA0%2C1%2C1%2C2%2C3%2C5%2C%E2%80%A6%2C%E5%85%B6%E8%A7%84%E5%BE%8B%E6%98%AF%EF%BC%9AF1%3D0+%EF%BC%88n%3D1%EF%BC%89+F2%3D1+%EF%BC%88n%3D2%EF%BC%89+Fn%3DFn-1Fibonacci%E6%95%B0%E5%88%97%2C%E5%89%8D%E5%87%A0%E4%B8%AA%E6%95%B0%E4%B8%BA0%2C1%2C1%2C2%2C3%2C5%2C%E2%80%A6%2C%E5%85%B6%E8%A7%84%E5%BE%8B%E6%98%AF%EF%BC%9A%5Cx05%5Cx05F1%3D0+%EF%BC%88n%3D1%EF%BC%89%5Cx05%5Cx05F2%3D1+%EF%BC%88n%3D2%EF%BC%89%5Cx05%5Cx05Fn%3DFn-1%2BFn-2+%EF%BC%88n%E2%89%A53%EF%BC%89%5Cx0)
用delphi Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:F1=0 (n=1) F2=1 (n=2) Fn=Fn-1Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:\x05\x05F1=0 (n=1)\x05\x05F2=1 (n=2)\x05\x05Fn=Fn-1+Fn-2 (n≥3)\x0
用delphi Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:F1=0 (n=1) F2=1 (n=2) Fn=Fn-1
Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:
\x05\x05F1=0 (n=1)
\x05\x05F2=1 (n=2)
\x05\x05Fn=Fn-1+Fn-2 (n≥3)
\x05编程序求此数列的前40个数.
用delphi Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:F1=0 (n=1) F2=1 (n=2) Fn=Fn-1Fibonacci数列,前几个数为0,1,1,2,3,5,…,其规律是:\x05\x05F1=0 (n=1)\x05\x05F2=1 (n=2)\x05\x05Fn=Fn-1+Fn-2 (n≥3)\x0
function TForm1.getFibo:string;
var
a:array [0..40] of integer;
i:integer;
begin
Result := '0 1';
a[0] := 0;
a[1] := 1;
for i:=2 to 40 do
begin
a[i] := a[i-1]+a[i-2];
Result := Result + ' ' + IntToStr(a[i]);
end;
end;
procedure TForm1.btn1Click(Sender:TObject);
begin
ShowMessage(getFibo);
end;