Improved prettier

Author: javadev

.prettierrc.js

@@ -1,7 +1,7 @@
 module.exports = {
   printWidth: 120,
-  tabWidth: 2,
-  semi: true,
+  tabWidth: 4,
+  semi: false,
   singleQuote: true,
   trailingComma: 'all',
   arrowParens: 'always',

package.json

@@ -6,7 +6,7 @@
   "scripts": {
     "lint:ts": "tslint -c tslint.json 'src/**/*.ts'",
     "lint:fixts": "tslint -c tslint.json 'src/**/*.ts' --fix",
-    "prettier": "prettier -c --write ./src",
+    "prettier": "prettier -c --write ./src/**/*.ts",
     "build": "rm -rf ./dist && tsc",
     "precommit": "lint-staged",
     "prepare": "husky install",

src/main/ts/com_github_leetcode/listnode.ts

@@ -0,0 +1,11 @@
+class ListNode {
+    public val: number | null
+    public next: ListNode | null
+
+    constructor(val?: number | null, next?: ListNode | null) {
+        this.val = val === undefined ? 0 : val
+        this.next = next === undefined ? null : next
+    }
+}
+
+export { ListNode }

src/main/ts/g0001_0100/s0001_two_sum/solution.ts

@@ -3,18 +3,18 @@
 // #2023_03_10_Time_66_ms_(93.20%)_Space_45.6_MB_(23.43%)
 
 interface ITemp {
-  [key: number]: number;
+    [key: number]: number
 }
 
 function twoSum(nums: number[], target: number): number[] {
-  const temp: ITemp = {};
-  for (let i = 0; i < nums.length; i++) {
-    const tag = target - nums[i];
-    if (temp[tag] >= 0) {
-      return [temp[tag], i];
+    const temp: ITemp = {}
+    for (let i = 0; i < nums.length; i++) {
+        const tag = target - nums[i]
+        if (temp[tag] >= 0) {
+            return [temp[tag], i]
+        }
+        temp[nums[i]] = i
     }
-    temp[nums[i]] = i;
-  }
 }
 
-export { twoSum };
+export { twoSum }

src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts

@@ -2,15 +2,7 @@
 // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
 // #2023_03_10_Time_106_ms_(79.11%)_Space_48.6_MB_(31.94%)
 
-class ListNode {
-  public val: number | null;
-  public next: ListNode | null;
-
-  constructor(val?: number | null, next?: ListNode | null) {
-    this.val = val === undefined ? 0 : val;
-    this.next = next === undefined ? null : next;
-  }
-}
+import { ListNode } from '../../com_github_leetcode/listnode'
 
 /*
  * Definition for singly-linked list.
@@ -24,29 +16,29 @@ class ListNode {
  * }
  */
 function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | null {
-  const result = new ListNode(null);
-  let next = result;
-  let carryNum = 0;
-  let currSum = 0;
-  let num1 = 0;
-  let num2 = 0;
+    const result = new ListNode(null)
+    let next = result
+    let carryNum = 0
+    let currSum = 0
+    let num1 = 0
+    let num2 = 0
 
-  while (l1 !== null || l2 !== null) {
-    // @ts-ignore
-    num1 = l1 !== null ? l1.val : 0;
-    // @ts-ignore
-    num2 = l2 !== null ? l2.val : 0;
-    currSum = (num1 + num2 + carryNum) % 10;
-    carryNum = Math.floor((num1 + num2 + carryNum) / 10);
-    next.next = new ListNode(currSum);
-    next = next.next;
-    l1 = l1 !== null ? l1.next : null;
-    l2 = l2 !== null ? l2.next : null;
-  }
-  if (carryNum) {
-    next.next = new ListNode(carryNum);
-  }
-  return result.next;
+    while (l1 !== null || l2 !== null) {
+        // @ts-ignore
+        num1 = l1 !== null ? l1.val : 0
+        // @ts-ignore
+        num2 = l2 !== null ? l2.val : 0
+        currSum = (num1 + num2 + carryNum) % 10
+        carryNum = Math.floor((num1 + num2 + carryNum) / 10)
+        next.next = new ListNode(currSum)
+        next = next.next
+        l1 = l1 !== null ? l1.next : null
+        l2 = l2 !== null ? l2.next : null
+    }
+    if (carryNum) {
+        next.next = new ListNode(carryNum)
+    }
+    return result.next
 }
 
-export { ListNode, addTwoNumbers };
+export { ListNode, addTwoNumbers }

src/test/ts/g0001_0100/s0001_two_sum/solution.test.ts

@@ -1,19 +1,19 @@
 // tslint:disable:no-magic-numbers
-import { twoSum } from 'src/main/ts/g0001_0100/s0001_two_sum/solution';
-import { expect, test } from 'vitest';
+import { twoSum } from 'src/main/ts/g0001_0100/s0001_two_sum/solution'
+import { expect, test } from 'vitest'
 
 test('twoSum', () => {
-  expect(twoSum([2, 7, 11, 15], 9)).toEqual([0, 1]);
-});
+    expect(twoSum([2, 7, 11, 15], 9)).toEqual([0, 1])
+})
 
 test('twoSum2', () => {
-  expect(twoSum([3, 2, 4], 6)).toEqual([1, 2]);
-});
+    expect(twoSum([3, 2, 4], 6)).toEqual([1, 2])
+})
 
 test('twoSum3', () => {
-  expect(twoSum([3, 3], 6)).toEqual([0, 1]);
-});
+    expect(twoSum([3, 3], 6)).toEqual([0, 1])
+})
 
 test('twoSum4', () => {
-  expect(twoSum([3, 3], 7)).toEqual(undefined);
-});
+    expect(twoSum([3, 3], 7)).toEqual(undefined)
+})

src/test/ts/g0001_0100/s0002_add_two_numbers/solution.test.ts

@@ -1,17 +1,20 @@
 // tslint:disable:no-magic-numbers
-import { addTwoNumbers, ListNode } from 'src/main/ts/g0001_0100/s0002_add_two_numbers/solution';
-import { expect, test } from 'vitest';
+import { addTwoNumbers, ListNode } from 'src/main/ts/g0001_0100/s0002_add_two_numbers/solution'
+import { expect, test } from 'vitest'
 
 test('addTwoNumbers', () => {
-  expect(
-    addTwoNumbers(new ListNode(2, new ListNode(4, new ListNode(3))), new ListNode(5, new ListNode(6, new ListNode(4)))),
-  ).toEqual(new ListNode(7, new ListNode(0, new ListNode(8))));
-});
+    expect(
+        addTwoNumbers(
+            new ListNode(2, new ListNode(4, new ListNode(3))),
+            new ListNode(5, new ListNode(6, new ListNode(4))),
+        ),
+    ).toEqual(new ListNode(7, new ListNode(0, new ListNode(8))))
+})
 
 test('addTwoNumbers2', () => {
-  expect(new ListNode(7).val).toEqual(7);
-});
+    expect(new ListNode(7).val).toEqual(7)
+})
 
 test('addTwoNumbers3', () => {
-  expect(addTwoNumbers(new ListNode(5), new ListNode(5))).toEqual(new ListNode(0, new ListNode(1)));
-});
+    expect(addTwoNumbers(new ListNode(5), new ListNode(5))).toEqual(new ListNode(0, new ListNode(1)))
+})