Skip to content

Update 10.1 斐波那契数列.md #1213

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open

chandan23sde wants to merge 1 commit into CyC2018:master

from chandan23sde:patch-1

Open

Update 10.1 斐波那契数列.md #1213

Changes from all commits

Commits

Show all changes

Select commit

Update 10.1 斐波那契数列.md

chandan23sde Oct 7, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

16 changes: 16 additions & 0 deletions notes/10.1 斐波那契数列.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -31,6 +31,22 @@ public int Fibonacci(int n) {
		return fib[n];
		}
		```
	OR Simplified code
	class FibonacciExample1{
	public static void main(String args[])
	{
	int n1=0,n2=1,n3,i,count=10;
	System.out.print(n1+" "+n2);//printing 0 and 1

	for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed
	{
	n3=n1+n2;
	System.out.print(" "+n3);
	n1=n2;
	n2=n3;
	}

	}}

		考虑到第 i 项只与第 i-1 和第 i-2 项有关,因此只需要存储前两项的值就能求解第 i 项,从而将空间复杂度由 O(N) 降低为 O(1)。

Expand Down