Improved tasks 80-92

Author: javadev

src/test/ts/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/solution.test.ts

@@ -3,9 +3,9 @@ import { removeDuplicates } from 'src/main/ts/g0001_0100/s0080_remove_duplicates
 import { expect, test } from 'vitest'
 
 test('removeDuplicates', () => {
-    expect(removeDuplicates([1,1,1,2,2,3])).toEqual(5)
+    expect(removeDuplicates([1, 1, 1, 2, 2, 3])).toEqual(5)
 })
 
 test('removeDuplicates2', () => {
-    expect(removeDuplicates([0,0,1,1,1,1,2,3,3])).toEqual(7)
+    expect(removeDuplicates([0, 0, 1, 1, 1, 1, 2, 3, 3])).toEqual(7)
 })

src/test/ts/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/solution.test.ts

@@ -4,9 +4,9 @@ import { expect, test } from 'vitest'
 import { constructLinkedList } from '../../com_github_leetcode/linkedlistutils'
 
 test('deleteDuplicates', () => {
-    expect(deleteDuplicates(constructLinkedList([1,2,3,3,4,4,5])).toString()).toEqual('1, 2, 5')
+    expect(deleteDuplicates(constructLinkedList([1, 2, 3, 3, 4, 4, 5])).toString()).toEqual('1, 2, 5')
 })
 
 test('deleteDuplicates2', () => {
-    expect(deleteDuplicates(constructLinkedList([1,1,1,2,3])).toString()).toEqual('2, 3')
+    expect(deleteDuplicates(constructLinkedList([1, 1, 1, 2, 3])).toString()).toEqual('2, 3')
 })

src/test/ts/g0001_0100/s0086_partition_list/solution.test.ts

@@ -4,9 +4,9 @@ import { expect, test } from 'vitest'
 import { constructLinkedList } from '../../com_github_leetcode/linkedlistutils'
 
 test('partition', () => {
-    expect(partition(constructLinkedList([1,4,3,2,5,2]), 3).toString()).toEqual('1, 2, 2, 4, 3, 5')
+    expect(partition(constructLinkedList([1, 4, 3, 2, 5, 2]), 3).toString()).toEqual('1, 2, 2, 4, 3, 5')
 })
 
 test('partition2', () => {
-    expect(partition(constructLinkedList([2,1]), 2).toString()).toEqual('1, 2')
+    expect(partition(constructLinkedList([2, 1]), 2).toString()).toEqual('1, 2')
 })

src/test/ts/g0001_0100/s0088_merge_sorted_array/solution.test.ts

@@ -3,9 +3,9 @@ import { merge } from 'src/main/ts/g0001_0100/s0088_merge_sorted_array/solution'
 import { expect, test } from 'vitest'
 
 test('merge', () => {
-    const nums1 = [1,2,3,0,0,0]
-    merge(nums1, 3, [2,5,6], 3)
-    expect(nums1).toEqual([1,2,2,3,5,6])
+    const nums1 = [1, 2, 3, 0, 0, 0]
+    merge(nums1, 3, [2, 5, 6], 3)
+    expect(nums1).toEqual([1, 2, 2, 3, 5, 6])
 })
 
 test('merge2', () => {

src/test/ts/g0001_0100/s0092_reverse_linked_list_ii/solution.test.ts

@@ -4,7 +4,7 @@ import { expect, test } from 'vitest'
 import { constructLinkedList } from '../../com_github_leetcode/linkedlistutils'
 
 test('reverseBetween', () => {
-    expect(reverseBetween(constructLinkedList([1,2,3,4,5]), 2, 4).toString()).toEqual('1, 4, 3, 2, 5')
+    expect(reverseBetween(constructLinkedList([1, 2, 3, 4, 5]), 2, 4).toString()).toEqual('1, 4, 3, 2, 5')
 })
 
 test('reverseBetween2', () => {