fix: 로직 수정

Author: YeomChaeeun

contains-duplicate/YeomChaeeun.ts

@@ -26,7 +26,6 @@ function containsDuplicate(nums: number[]): boolean {
     let obj={}
 
     for(let i = 0; i < nums.length; i++) {
-        console.log('nums >>', nums[i], 'obj >>', obj)
         if(obj[nums[i]]) {
             return true;
         }

longest-consecutive-sequence/YeomChaeeun.ts

@@ -28,23 +28,17 @@ function longestConsecutive(nums: number[]): number {
     // =========
 
     let longest = 0;
-    let temp = 1;
-
+    let current = 1;
     for(let i = 0; i < nums.length-1; i++) {
-        if(nums[i] === nums[i + 1]) {
-            // console.log(nums[i], '===', nums[i+1])
+        if(nums[i] === nums[i - 1]) {
             continue;
         } else if(nums[i] + 1 === nums[i + 1] ) {
-            // console.log(nums[i], '+ 1 =', nums[i+1])
-            temp += 1;
+            current += 1;
         } else {
-            // console.log(longest, ' - ', temp)
-            longest = Math.max(temp, longest);
-            temp = 1;
+            longest = Math.max(current, longest);
+            current = 1;
         }
     }
 
-    // i가 마지막인 경우 for문의 else문을 타지 않으므로 다시 한번 체크함
-    longest = Math.max(temp, longest);
     return longest;
 };

top-k-frequent-elements/YeomChaeeun.ts

@@ -12,18 +12,8 @@ function topKFrequent(nums: number[], k: number): number[] {
         ++obj[num]
     }
 
-    // 배열로 변경
-    let entries = Object.entries(obj)
-    // 정렬
-    let sort_arr = entries.sort((a, b) => Number(b[1]) - Number(a[1]));
-
-    let result = [];
-    let l = 0;
-    for(const item of sort_arr) {
-        if(l == k) break;
-        result.push(Number(item[0]));
-        l++;
-    }
-
-    return result;
+    return Object.entries(obj)
+        .sort((a, b) => Number(b[1]) - Number(a[1]))
+        .slice(0, k)
+        .map(entry => Number(entry[0]));
 };

valid-palindrome/YeomChaeeun.ts

@@ -4,14 +4,12 @@
  */
 function isPalindrome(s: string): boolean {
     let word = s.toLowerCase();
-    const reg = /[\{\}\[\]\/?.,;:|\)*~`!^\-_+<>@\#$%&\\\=\(\'\" ]/g;
-
+    const reg = /[^a-z0-9]/g; // removing all non-alphanumeric characters
     word = word.replace(reg, '');
+
     for(let i = 0; i < word.length; i++) {
-        for(let j = word.length-i-1; j >= word.length-i-1; j--) {
-            // console.log(word[i], '===', word[j])
-            if(word[i] !== word[j]) return false;
-        }
+        if(word[i] !== word[word.length-i-1])
+            return false;
     }
     return true;
 };