We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 97e10ba commit f45731bCopy full SHA for f45731b
missing-number/HoonDongKang.ts
@@ -0,0 +1,26 @@
1
+/**
2
+ * [Problem]: [268] Missing Number
3
+ * (https://leetcode.com/problems/missing-number/description/)
4
+ */
5
+function missingNumber(nums: number[]): number {
6
+ //시간복잡도 O(n^2)
7
+ //공간복잡도 O(1)
8
+ function loopFunc(nums: number[]): number {
9
+ let num = 0;
10
+ while (true) {
11
+ if (!nums.includes(num)) break;
12
+ num++;
13
+ }
14
+
15
+ return num;
16
17
+ //시간복잡도 O(n)
18
19
+ function sumFunc(nums: number[]): number {
20
+ const n = nums.length;
21
+ const sum = nums.reduce((acc, cur) => (acc += cur), 0);
22
+ const expected = (n * (n + 1)) / 2;
23
24
+ return expected - sum;
25
26
+}
0 commit comments