[HAI] home work leetcode
parent
427731f797
commit
022f89a537
@ -0,0 +1,3 @@
|
||||
import { missingNumber } from "./missingNumber";
|
||||
|
||||
export default missingNumber;
|
||||
@ -0,0 +1,31 @@
|
||||
import { describe, it, expect } from "vitest";
|
||||
import { missingNumber } from "./missingNumber.ts";
|
||||
|
||||
describe("missingNumber", () => {
|
||||
|
||||
it("[3, 0, 1] expect 2", () => {
|
||||
const nums = [3, 0, 1];
|
||||
expect(missingNumber(nums)).toBe(2);
|
||||
});
|
||||
|
||||
it("[0, 1] expect 2", () => {
|
||||
const nums = [0, 1];
|
||||
expect(missingNumber(nums)).toBe(2);
|
||||
});
|
||||
|
||||
it("[9, 6, 4, 2, 3, 5, 7 , 0, 1] expect 8", () => {
|
||||
const nums = [9, 6, 4, 2, 3, 5, 7, 0, 1];
|
||||
expect(missingNumber(nums)).toBe(8);
|
||||
});
|
||||
|
||||
it("[0] expect 1", () => {
|
||||
const nums = [0];
|
||||
expect(missingNumber(nums)).toBe(1);
|
||||
});
|
||||
|
||||
it("[1, 2] expect 0", () => {
|
||||
const nums = [1, 2];
|
||||
expect(missingNumber(nums)).toBe(0);
|
||||
});
|
||||
|
||||
});
|
||||
@ -0,0 +1,13 @@
|
||||
export function missingNumber(nums: number[]) {
|
||||
|
||||
let overallSum = 0;
|
||||
for (let i = 0; i <= nums.length; i++) {
|
||||
overallSum += i;
|
||||
}
|
||||
|
||||
for (const num of nums) {
|
||||
overallSum -= num;
|
||||
}
|
||||
|
||||
return overallSum;
|
||||
};
|
||||
Loading…
Reference in New Issue