Commit fed8fa5

committed

soltion of fibonacci_number problem and tests

1 parent 303aa93 commit fed8fa5Copy full SHA for fed8fa5

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,9 @@`
	`1`	`+// https://leetcode.com/problems/fibonacci-number/`
	`2`	`+package fibonacci_number`
	`3`	`+`
	`4`	`+func fib(n int) int {`
	`5`	`+ if n == 0 \|\| n == 1 {`
	`6`	`+ return n`
	`7`	`+ }`
	`8`	`+ return fib(n-1) + fib(n-2)`
	`9`	`+}`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+package fibonacci_number`
	`2`	`+`
	`3`	`+import (`
	`4`	`+ "testing"`
	`5`	`+)`
	`6`	`+`
	`7`	`+func Test_fib(t *testing.T) {`
	`8`	`+ cases := []struct {`
	`9`	`+ num int`
	`10`	`+ expected int`
	`11`	`+ }{`
	`12`	`+ {0, 0},`
	`13`	`+ {1, 1},`
	`14`	`+ {2, 1},`
	`15`	`+ {3, 2},`
	`16`	`+ {4, 3},`
	`17`	`+ {30, 832040},`
	`18`	`+ }`
	`19`	`+`
	`20`	`+ for idx, tc := range cases {`
	`21`	`+ res := fib(tc.num)`
	`22`	`+ if tc.expected != res {`
	`23`	`+ t.Errorf("case %d. expecting %d, got %d", idx, tc.expected, res)`
	`24`	`+ }`
	`25`	`+ }`
	`26`	`+}`

Comments

(0)