Improved tasks 12-28

Author: javadev

src/main/ts/g0001_0100/s0012_integer_to_roman/solution.ts

@@ -2,22 +2,19 @@
 // #2025_03_31_Time_3_ms_(93.02%)_Space_61.86_MB_(54.05%)
 
 function intToRoman(num: number): string {
-    const values = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];
-    const symbols = ["M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"];
-
-    let result = "";
-    let i = 0;
-
+    const values = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]
+    const symbols = ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I']
+    let result = ''
+    let i = 0
     while (num > 0) {
         if (num >= values[i]) {
-            result += symbols[i];
-            num -= values[i];
+            result += symbols[i]
+            num -= values[i]
         } else {
-            i++;
+            i++
         }
     }
-
-    return result;
-};
+    return result
+}
 
 export { intToRoman }

src/main/ts/g0001_0100/s0013_roman_to_integer/solution.ts

@@ -2,50 +2,48 @@
 // #Top_Interview_150_Array/String #2025_03_31_Time_3_ms_(94.58%)_Space_61.52_MB_(51.93%)
 
 function romanToInt(s: string): number {
-    let x = 0;
-    let y: string;
-
+    let x = 0
+    let y: string
     for (let i = 0; i < s.length; i++) {
-        y = s.charAt(i);
+        y = s.charAt(i)
         switch (y) {
             case 'I':
-                x = getX(s, x, i, 1, 'V', 'X');
-                break;
+                x = getX(s, x, i, 1, 'V', 'X')
+                break
             case 'V':
-                x += 5;
-                break;
+                x += 5
+                break
             case 'X':
-                x = getX(s, x, i, 10, 'L', 'C');
-                break;
+                x = getX(s, x, i, 10, 'L', 'C')
+                break
             case 'L':
-                x += 50;
-                break;
+                x += 50
+                break
             case 'C':
-                x = getX(s, x, i, 100, 'D', 'M');
-                break;
+                x = getX(s, x, i, 100, 'D', 'M')
+                break
             case 'D':
-                x += 500;
-                break;
+                x += 500
+                break
             case 'M':
-                x += 1000;
-                break;
+                x += 1000
+                break
             default:
-                break;
+                break
         }
     }
-    return x;
+    return x
 }
 
 function getX(s: string, x: number, i: number, i2: number, v: string, x2: string): number {
     if (i + 1 === s.length) {
-        x += i2;
+        x += i2
     } else if (s.charAt(i + 1) === v || s.charAt(i + 1) === x2) {
-        x -= i2;
+        x -= i2
     } else {
-        x += i2;
+        x += i2
     }
-    return x;
+    return x
 }
 
-
 export { romanToInt }

src/main/ts/g0001_0100/s0014_longest_common_prefix/solution.ts

@@ -4,26 +4,26 @@
 
 function longestCommonPrefix(strs: string[]): string {
     if (strs.length < 1) {
-        return "";
+        return ''
     }
     if (strs.length === 1) {
-        return strs[0];
+        return strs[0]
     }
-    let temp = strs[0];
-    let i = 1;
-    let cur: string;
+    let temp = strs[0]
+    let i = 1
+    let cur: string
     while (temp.length > 0 && i < strs.length) {
         if (temp.length > strs[i].length) {
-            temp = temp.substring(0, strs[i].length);
+            temp = temp.substring(0, strs[i].length)
         }
-        cur = strs[i].substring(0, temp.length);
+        cur = strs[i].substring(0, temp.length)
         if (cur !== temp) {
-            temp = temp.substring(0, temp.length - 1);
+            temp = temp.substring(0, temp.length - 1)
         } else {
-            i++;
+            i++
         }
     }
-    return temp;
+    return temp
 }
 
 export { longestCommonPrefix }

src/main/ts/g0001_0100/s0026_remove_duplicates_from_sorted_array/solution.ts

@@ -2,20 +2,20 @@
 // #Top_Interview_150_Array/String #2025_03_31_Time_0_ms_(100.00%)_Space_58.42_MB_(57.44%)
 
 function removeDuplicates(nums: number[]): number {
-    let n = nums.length;
-    let i = 0;
-    let j = 1;
+    let n = nums.length
+    let i = 0
+    let j = 1
     if (n <= 1) {
-        return n;
+        return n
     }
     while (j <= n - 1) {
         if (nums[i] !== nums[j]) {
-            nums[i + 1] = nums[j];
-            i++;
+            nums[i + 1] = nums[j]
+            i++
         }
-        j++;
+        j++
     }
-    return i + 1;
+    return i + 1
 }
 
 export { removeDuplicates }

src/main/ts/g0001_0100/s0027_remove_element/solution.ts

@@ -3,32 +3,32 @@
 
 function removeElement(nums: number[], val: number): number {
     if (!nums || nums.length === 0) {
-        return 0;
+        return 0
     }
-    let len = nums.length;
-    let j = len - 1;
-    let occurTimes = 0;
+    let len = nums.length
+    let j = len - 1
+    let occurTimes = 0
     for (let i = 0; i < len; i++) {
         if (nums[i] === val) {
-            occurTimes++;
+            occurTimes++
             if (j === i) {
-                return len - occurTimes;
+                return len - occurTimes
             }
             while (nums[j] === val) {
-                j--;
-                occurTimes++;
+                j--
+                occurTimes++
                 if (j === i) {
-                    return len - occurTimes;
+                    return len - occurTimes
                 }
             }
-            nums[i] = nums[j];
-            j--;
+            nums[i] = nums[j]
+            j--
         }
         if (i === j) {
-            return len - occurTimes;
+            return len - occurTimes
         }
     }
-    return len - occurTimes;
+    return len - occurTimes
 }
 
 export { removeElement }

src/main/ts/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/solution.ts

@@ -4,16 +4,16 @@
 
 function strStr(haystack: string, needle: string): number {
     if (needle.length === 0) {
-        return 0;
+        return 0
     }
-    let m = haystack.length;
-    let n = needle.length;
+    let m = haystack.length
+    let n = needle.length
     for (let start = 0; start <= m - n; start++) {
         if (haystack.substring(start, start + n) === needle) {
-            return start;
+            return start
         }
     }
-    return -1;
+    return -1
 }
 
 export { strStr }

src/test/ts/g0001_0100/s0014_longest_common_prefix/solution.test.ts

@@ -9,3 +9,11 @@ test('longestCommonPrefix', () => {
 test('longestCommonPrefix2', () => {
     expect(longestCommonPrefix(['dog','racecar','car'])).toEqual('')
 })
+
+test('longestCommonPrefix3', () => {
+    expect(longestCommonPrefix([])).toEqual('')
+})
+
+test('longestCommonPrefix4', () => {
+    expect(longestCommonPrefix(['dog'])).toEqual('dog')
+})

src/test/ts/g0001_0100/s0027_remove_element/solution.test.ts

@@ -9,3 +9,22 @@ test('removeElement', () => {
 test('removeElement2', () => {
     expect(removeElement([0,1,2,2,3,0,4,2], 2)).toEqual(5)
 })
+
+test('removeElement3', () => {
+    const nums: number[] = []
+    const val = 1
+    expect(removeElement(nums, val)).toEqual(0)
+})
+
+test('removeElement4', () => {
+    const nums = [1, 1, 1, 1]
+    const val = 1
+    expect(removeElement(nums, val)).toEqual(0)
+})
+
+test('removeElement5', () => {
+    const nums = [4, 5]
+    const val = 4
+    expect(removeElement(nums, val)).toEqual(1)
+    expect(nums[0]).toEqual(5)
+})

src/test/ts/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/solution.test.ts

@@ -3,9 +3,13 @@ import { strStr } from 'src/main/ts/g0001_0100/s0028_find_the_index_of_the_first
 import { expect, test } from 'vitest'
 
 test('strStr', () => {
-    expect(strStr("sadbutsad", "sad")).toEqual(0)
+    expect(strStr('sadbutsad', 'sad')).toEqual(0)
 })
 
 test('strStr2', () => {
-    expect(strStr("leetcode", "leeto")).toEqual(-1)
+    expect(strStr('leetcode', 'leeto')).toEqual(-1)
+})
+
+test('strStr3', () => {
+    expect(strStr('leetcode', '')).toEqual(0)
 })