Improved tasks 57-66

Author: javadev

src/main/ts/g0001_0100/s0057_insert_interval/solution.ts

@@ -17,7 +17,7 @@ function insert(intervals: number[][], newInterval: number[]): number[][] {
     }
     res[l] = [
         Math.min(newInterval[0], l === n ? newInterval[0] : intervals[l][0]),
-        Math.max(newInterval[1], r === -1 ? newInterval[1] : intervals[r][1])
+        Math.max(newInterval[1], r === -1 ? newInterval[1] : intervals[r][1]),
     ]
     for (let i = l + 1, j = r + 1; j < n; i++, j++) {
         res[i] = intervals[j]

src/test/ts/g0001_0100/s0057_insert_interval/solution.test.ts

@@ -3,9 +3,35 @@ import { insert } from 'src/main/ts/g0001_0100/s0057_insert_interval/solution'
 import { expect, test } from 'vitest'
 
 test('insert', () => {
-    expect(insert([[1,3],[6,9]], [2,5])).toEqual([[1,5],[6,9]])
+    expect(
+        insert(
+            [
+                [1, 3],
+                [6, 9],
+            ],
+            [2, 5],
+        ),
+    ).toEqual([
+        [1, 5],
+        [6, 9],
+    ])
 })
 
 test('insert2', () => {
-    expect(insert( [[1,2],[3,5],[6,7],[8,10],[12,16]], [4,8])).toEqual([[1,2],[3,10],[12,16]])
+    expect(
+        insert(
+            [
+                [1, 2],
+                [3, 5],
+                [6, 7],
+                [8, 10],
+                [12, 16],
+            ],
+            [4, 8],
+        ),
+    ).toEqual([
+        [1, 2],
+        [3, 10],
+        [12, 16],
+    ])
 })

src/test/ts/g0001_0100/s0061_rotate_list/solution.test.ts

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

src/test/ts/g0001_0100/s0063_unique_paths_ii/solution.test.ts

@@ -3,9 +3,20 @@ import { uniquePathsWithObstacles } from 'src/main/ts/g0001_0100/s0063_unique_pa
 import { expect, test } from 'vitest'
 
 test('uniquePathsWithObstacles', () => {
-    expect(uniquePathsWithObstacles([[0,0,0],[0,1,0],[0,0,0]])).toEqual(2)
+    expect(
+        uniquePathsWithObstacles([
+            [0, 0, 0],
+            [0, 1, 0],
+            [0, 0, 0],
+        ]),
+    ).toEqual(2)
 })
 
 test('uniquePathsWithObstacles2', () => {
-    expect(uniquePathsWithObstacles([[0,1],[0,0]])).toEqual(1)
+    expect(
+        uniquePathsWithObstacles([
+            [0, 1],
+            [0, 0],
+        ]),
+    ).toEqual(1)
 })

src/test/ts/g0001_0100/s0066_plus_one/solution.test.ts

@@ -3,13 +3,13 @@ import { plusOne } from 'src/main/ts/g0001_0100/s0066_plus_one/solution'
 import { expect, test } from 'vitest'
 
 test('plusOne', () => {
-    expect(plusOne([1,2,3])).toEqual([1,2,4])
+    expect(plusOne([1, 2, 3])).toEqual([1, 2, 4])
 })
 
 test('plusOne2', () => {
-    expect(plusOne([4,3,2,1])).toEqual([4,3,2,2])
+    expect(plusOne([4, 3, 2, 1])).toEqual([4, 3, 2, 2])
 })
 
 test('plusOne3', () => {
-    expect(plusOne([9])).toEqual([1,0])
+    expect(plusOne([9])).toEqual([1, 0])
 })