fibonacciNumber(n: number): number | bigint,result < Number.MAX_SAFE_INTEGER

Author: masx200

fibonacci-number/index.ts

@@ -1,7 +1,12 @@
 // My code goes here
 /**https://leetcode-cn.com/problems/fibonacci-number/ */
-export default function fibonacciNumber(n: number): number {
-    return Number(getfbnq(BigInt(n)));
+export default function fibonacciNumber(n: number): number | bigint {
+    const result = getfbnq(BigInt(n));
+    if (result < Number.MAX_SAFE_INTEGER) {
+        return Number(result);
+    } else {
+        return result;
+    }
 }
 
 function getfbnq(num: bigint): bigint {

fibonacci-number/test.ts

@@ -2,12 +2,16 @@ import { assertStrictEquals } from "../deps.ts";
 import { fibonacciNumber } from "../mod.ts";
 
 Deno.test("fibonacci-number", () => {
-    const examples: { input: number; output: number }[] = [
+    const examples: {
+        input: number;
+        output: ReturnType<typeof fibonacciNumber>;
+    }[] = [
         { input: 2, output: 1 },
         { input: 3, output: 2 },
         { input: 4, output: 3 },
         { input: 30, output: 832040 },
         { input: 20, output: 6765 },
+        { input: 99, output: 218922995834555169026n },
     ];
     examples.forEach(({ input, output }) => {
         assertStrictEquals(fibonacciNumber(input), output);

two-sum/test.ts

@@ -9,7 +9,7 @@ Deno.test("two-sum", () => {
         { input: [[3, 3], 6], output: [0, 1] },
         { input: [[2, 7, 11, 15], 9], output: [0, 1] },
         { input: [[3, 2, 4], 6], output: [1, 2] },
-        { input: [Array(25).fill(0).map((_v, i) => i), 30], output: [14,16] },
+        { input: [Array(25).fill(0).map((_v, i) => i), 30], output: [14, 16] },
     ];
     examples.forEach(({ input, output }) => {
         assertEquals(new Set(twoSum(...input)), new Set(output));