Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit2bcbc58

Browse files
authored
Added all missing tests
1 parentf4f1d53 commit2bcbc58

File tree

1 file changed

+41
-6
lines changed

1 file changed

+41
-6
lines changed

‎Maths/test/Fibonacci.test.js

Lines changed: 41 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -8,24 +8,34 @@ import {
88

99
describe('Fibonacci',()=>{
1010
it('should return an array of numbers for FibonacciIterative',()=>{
11-
expect(FibonacciIterative(5)).toEqual(
12-
expect.arrayContaining([1,1,2,3,5])
11+
expect(FibonacciIterative(6)).toEqual(
12+
expect.arrayContaining([0,1,1,2,3,5,8])
13+
)
14+
expect(FibonacciIterative(-6)).toEqual(
15+
expect.arrayContaining([0,1,-1,2,-3,5,-8])
1316
)
1417
})
1518

1619
it('should return an array of numbers for FibonacciRecursive',()=>{
17-
expect(FibonacciRecursive(5)).toEqual(
18-
expect.arrayContaining([1,1,2,3,5])
20+
expect(FibonacciRecursive(6)).toEqual(
21+
expect.arrayContaining([0,1,1,2,3,5,8])
22+
)
23+
expect(FibonacciRecursive(-6)).toEqual(
24+
expect.arrayContaining([0,1,-1,2,-3,5,-8])
1925
)
2026
})
2127

2228
it('should return number for FibonacciRecursiveDP',()=>{
2329
expect(FibonacciRecursiveDP(5)).toBe(5)
30+
expect(FibonacciRecursiveDP(-6)).toBe(-8)
2431
})
2532

2633
it('should return an array of numbers for FibonacciDpWithoutRecursion',()=>{
27-
expect(FibonacciDpWithoutRecursion(5)).toEqual(
28-
expect.arrayContaining([1,1,2,3,5])
34+
expect(FibonacciDpWithoutRecursion(6)).toEqual(
35+
expect.arrayContaining([0,1,1,2,3,5,8])
36+
)
37+
expect(FibonacciDpWithoutRecursion(-6)).toEqual(
38+
expect.arrayContaining([0,1,-1,2,-3,5,-8])
2939
)
3040
})
3141

@@ -36,5 +46,30 @@ describe('Fibonacci', () => {
3646
expect(FibonacciMatrixExpo(3)).toBe(2)
3747
expect(FibonacciMatrixExpo(4)).toBe(3)
3848
expect(FibonacciMatrixExpo(5)).toBe(5)
49+
expect(FibonacciMatrixExpo(6)).toBe(8)
50+
51+
expect(FibonacciMatrixExpo(0n)).toBe(0n)
52+
expect(FibonacciMatrixExpo(1n)).toBe(1n)
53+
expect(FibonacciMatrixExpo(2n)).toBe(1n)
54+
expect(FibonacciMatrixExpo(3n)).toBe(2n)
55+
expect(FibonacciMatrixExpo(4n)).toBe(3n)
56+
expect(FibonacciMatrixExpo(5n)).toBe(5n)
57+
expect(FibonacciMatrixExpo(6n)).toBe(8n)
58+
59+
expect(FibonacciMatrixExpo(-0)).toBe(-0)
60+
expect(FibonacciMatrixExpo(-1)).toBe(1)
61+
expect(FibonacciMatrixExpo(-2)).toBe(-1)
62+
expect(FibonacciMatrixExpo(-3)).toBe(2)
63+
expect(FibonacciMatrixExpo(-4)).toBe(-3)
64+
expect(FibonacciMatrixExpo(-5)).toBe(5)
65+
expect(FibonacciMatrixExpo(-6)).toBe(-8)
66+
67+
expect(FibonacciMatrixExpo(-0n)).toBe(0n)
68+
expect(FibonacciMatrixExpo(-1n)).toBe(1n)
69+
expect(FibonacciMatrixExpo(-2n)).toBe(-1n)
70+
expect(FibonacciMatrixExpo(-3n)).toBe(2n)
71+
expect(FibonacciMatrixExpo(-4n)).toBe(-3n)
72+
expect(FibonacciMatrixExpo(-5n)).toBe(5n)
73+
expect(FibonacciMatrixExpo(-6n)).toBe(-8n)
3974
})
4075
})

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp