This repository was archived by the owner on Dec 19, 2023. It is now read-only.

Commit b618034

committed

Add problem 509

1 parent 757ae04 commit b618034Copy full SHA for b618034

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,39 @@`
	`1`	`+## 509. Fibonacci Number`
	`2`	`+`
	`3`	+The Fibonacci numbers, commonly denoted `F(n)` form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from `0` and `1`. That is,
	`4`	`+`
	`5`	`+<pre>`
	`6`	`+F(0) = 0, F(1) = 1`
	`7`	`+F(N) = F(N - 1) + F(N - 2), for N > 1.`
	`8`	`+</pre>`
	`9`	`+`
	`10`	+Given `N`, calculate `F(N)`.
	`11`	`+`
	`12`	`+<br>`
	`13`	`+`
	`14`	`+Example 1:`
	`15`	`+<pre>`
	`16`	`+<b>Input:</b> 2`
	`17`	`+<b>Output:</b> 1`
	`18`	`+<b>Explanation:</b> F(2) = F(1) + F(0) = 1 + 0 = 1.`
	`19`	`+</pre>`
	`20`	`+`
	`21`	`+Example 2:`
	`22`	`+<pre>`
	`23`	`+<b>Input:</b> 3`
	`24`	`+<b>Output:</b> 2`
	`25`	`+<b>Explanation:</b> F(3) = F(2) + F(1) = 1 + 1 = 2.`
	`26`	`+</pre>`
	`27`	`+`
	`28`	`+Example 3:`
	`29`	`+<pre>`
	`30`	`+<b>Input:</b> 4`
	`31`	`+<b>Output:</b> 3`
	`32`	`+<b>Explanation:</b> F(4) = F(3) + F(2) = 2 + 1 = 3.`
	`33`	`+</pre>`
	`34`	`+`
	`35`	`+<br>`
	`36`	`+`
	`37`	`+Note:`
	`38`	`+`
	`39`	+0 ≤ `N` ≤ 30.

Lines changed: 17 additions & 0 deletions

Comments

(0)