fix: lint 에러 수정

Author: sukyoungshin

contains-duplicate/suKyoung.ts

@@ -9,7 +9,7 @@ function containsDuplicate1(nums: number[]): boolean {
   });
 
   return isDuplicate;
-}
+};
 
 // 2번째 풀이(Set)
 function containsDuplicate2(nums: number[]): boolean {
@@ -23,4 +23,4 @@ function containsDuplicate2(nums: number[]): boolean {
   }
 
   return false;
-}
+};

house-robber/suKyoung.ts

@@ -17,16 +17,15 @@
 
 // 2번풀이 (dp)
 function rob(nums: number[]): number {
-    if (nums.length <= 1) return nums[0] ?? 0;
-  
-    const dp: number[] = [];
-    dp[0] = nums[0];
-    dp[1] = Math.max(nums[0], nums[1]);
-  
-    for (let i = 2; i < nums.length; i++) {
-      dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
-    }
-  
-    return dp[nums.length - 1];
+  if (nums.length <= 1) return nums[0] ?? 0;
+
+  const dp: number[] = [];
+  dp[0] = nums[0];
+  dp[1] = Math.max(nums[0], nums[1]);
+
+  for (let i = 2; i < nums.length; i++) {
+    dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
   }
-  
+
+  return dp[nums.length - 1];
+};

longest-consecutive-sequence/suKyoung.ts

@@ -20,7 +20,7 @@ function longestConsecutive2(nums: number[]): number {
   }
 
   return max;
-}
+};
 
 // 2번풀이 (hashSet)
 function longestConsecutive(nums: number[]): number {
@@ -43,4 +43,4 @@ function longestConsecutive(nums: number[]): number {
   }
 
   return max;
-}
+};

top-k-frequent-elements/suKyoung.ts

@@ -4,15 +4,15 @@ type FrequencyMap = Record<number, number>;
 function topKFrequentCountDown(nums: number[], k: number): number[] {
   const freqMap = buildFrequencyMap1(nums);
   return pickTopKDescending(freqMap, k);
-}
+};
 
 function buildFrequencyMap1(nums: number[]): FrequencyMap {
   const map: FrequencyMap = {};
   for (const num of nums) {
     map[num] = (map[num] || 0) + 1;
   }
   return map;
-}
+};
 
 function pickTopKDescending(freqMap: FrequencyMap, k: number): number[] {
   const result: number[] = [];
@@ -33,73 +33,72 @@ function pickTopKDescending(freqMap: FrequencyMap, k: number): number[] {
   }
 
   return result;
-}
-
+};
 
 // 2번풀이(Bucket Sort)
 function topKFrequent(nums: number[], k: number): number[] {
-    const frequencyMap = buildFrequencyMap2(nums);
-    const frequencyBuckets = buildFrequencyBuckets(nums.length, frequencyMap);
+  const frequencyMap = buildFrequencyMap2(nums);
+  const frequencyBuckets = buildFrequencyBuckets(nums.length, frequencyMap);
 
-    return collectTopKFrequent(frequencyBuckets, k);
-  }
-  
-  function buildFrequencyMap2(nums: number[]): FrequencyMap {
-    const freqMap: FrequencyMap = {};
-    for (const num of nums) {
-      freqMap[num] = (freqMap[num] || 0) + 1;
-    }
-    return freqMap;
+  return collectTopKFrequent(frequencyBuckets, k);
+};
+
+function buildFrequencyMap2(nums: number[]): FrequencyMap {
+  const freqMap: FrequencyMap = {};
+  for (const num of nums) {
+    freqMap[num] = (freqMap[num] || 0) + 1;
   }
-  
-  function buildFrequencyBuckets(
-    size: number,
-    freqMap: FrequencyMap
-  ): number[][] {
-    const buckets: number[][] = Array(size + 1).fill(null).map(() => []);
-  
-    for (const [numStr, frequent] of Object.entries(freqMap)) {
-      const num = Number(numStr);
-      buckets[frequent].push(num);
-    }
-  
-    return buckets;
+  return freqMap;
+};
+
+function buildFrequencyBuckets(
+  size: number,
+  freqMap: FrequencyMap
+): number[][] {
+  const buckets: number[][] = Array(size + 1)
+    .fill(null)
+    .map(() => []);
+
+  for (const [numStr, frequent] of Object.entries(freqMap)) {
+    const num = Number(numStr);
+    buckets[frequent].push(num);
   }
-  
-  function collectTopKFrequent(buckets: number[][], k: number): number[] {
-    const result: number[] = [];
-  
-    for (let i = buckets.length - 1; i >= 0 && result.length < k; i--) {
-      for (const num of buckets[i]) {
-        result.push(num);
-        if (result.length === k) break;
-      }
+
+  return buckets;
+};
+
+function collectTopKFrequent(buckets: number[][], k: number): number[] {
+  const result: number[] = [];
+
+  for (let i = buckets.length - 1; i >= 0 && result.length < k; i--) {
+    for (const num of buckets[i]) {
+      result.push(num);
+      if (result.length === k) break;
     }
-  
-    return result;
   }
-  
+
+  return result;
+};
 
 // 3번풀이 (MinHeap)
 function topKFrequentHeap(nums: number[], k: number): number[] {
-    const freqMap: Record<number, number> = {};
-  
-    for (const num of nums) {
-      freqMap[num] = (freqMap[num] || 0) + 1;
-    }
-  
-    const heap: [number, number][] = [];  
-    for (const [numStr, frequent] of Object.entries(freqMap)) {
-      const num = Number(numStr);
-  
-      heap.push([num, frequent]);
-      heap.sort((a, b) => b[1] - a[1]);
-
-      if (heap.length > k) {
-        heap.pop();
-      }
+  const freqMap: Record<number, number> = {};
+
+  for (const num of nums) {
+    freqMap[num] = (freqMap[num] || 0) + 1;
+  }
+
+  const heap: [number, number][] = [];
+  for (const [numStr, frequent] of Object.entries(freqMap)) {
+    const num = Number(numStr);
+
+    heap.push([num, frequent]);
+    heap.sort((a, b) => b[1] - a[1]);
+
+    if (heap.length > k) {
+      heap.pop();
     }
-  
-    return heap.map(([num]) => num);
   }
-  
+
+  return heap.map(([num]) => num);
+};

two-sum/suKyoung.ts

@@ -1,45 +1,45 @@
 // 1번째 풀이 (brute force)
 function twoSum1(nums: number[], target: number): number[] {
-    for(let i = 0; i < nums.length; i++) {
-        for (let j = 1; j < nums.length; j++) {
-            const a = nums[i];
-            const b = nums[j];
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = 1; j < nums.length; j++) {
+      const a = nums[i];
+      const b = nums[j];
 
-            if (a + b === target && i !== j) {
-                return [i, j];
-            }
-        }
+      if (a + b === target && i !== j) {
+        return [i, j];
+      }
     }
-    return [];
+  }
+  return [];
 };
 
 // 2번째 풀이 (indexOf)
 function twoSum2(nums: number[], target: number): number[] {
-    for (let i = 0; i < nums.length; i++) {
-      const j = target - nums[i];
-      const index = nums.indexOf(j);
-  
-      if (index !== -1 && i !== index) {
-        return [i, index];
-      }
+  for (let i = 0; i < nums.length; i++) {
+    const j = target - nums[i];
+    const index = nums.indexOf(j);
+
+    if (index !== -1 && i !== index) {
+      return [i, index];
     }
-    return [];
-  };
+  }
+  return [];
+};
 
 // 3번째 풀이 (HashMap)
-function twoSum(nums: number[], target: number): number[] {
-    const map: Record<number, number> = {};
-    
-    for (let i = 0; i < nums.length; i++) {
-        const complement = target - nums[i];
+function twoSum3(nums: number[], target: number): number[] {
+  const map: Record<number, number> = {};
+
+  for (let i = 0; i < nums.length; i++) {
+    const complement = target - nums[i];
 
-        if (complement in map) {
-            const j = map[complement];
-            return [i, j];
-        } else {
-            map[nums[i]] = i;
-        }
+    if (complement in map) {
+      const j = map[complement];
+      return [i, j];
+    } else {
+      map[nums[i]] = i;
     }
+  }
 
-    return [];
+  return [];
 };