Improved tasks 127, 129, 137

Author: javadev

src/main/ts/g0101_0200/s0127_word_ladder/solution.ts

@@ -14,7 +14,7 @@ function ladderLength(beginWord: string, endWord: string, wordList: string[]): n
     const wordLen = beginWord.length
     while (beginSet.size > 0 && endSet.size > 0) {
         if (beginSet.size > endSet.size) {
-            [beginSet, endSet] = [endSet, beginSet]
+            ;[beginSet, endSet] = [endSet, beginSet]
         }
         const tempSet: Set<string> = new Set()
         for (const word of beginSet) {

src/main/ts/g0101_0200/s0129_sum_root_to_leaf_numbers/solution.ts

@@ -1,7 +1,7 @@
 // #Medium #Depth_First_Search #Tree #Binary_Tree #Top_Interview_150_Binary_Tree_General
 // #2025_04_07_Time_0_ms_(100.00%)_Space_57.72_MB_(19.07%)
 
-import { TreeNode } from "../../com_github_leetcode/treenode"
+import { TreeNode } from '../../com_github_leetcode/treenode'
 
 /**
  * Definition for a binary tree node.

src/main/ts/g0101_0200/s0137_single_number_ii/solution.ts

@@ -5,8 +5,8 @@ function singleNumber(nums: number[]): number {
     let ones = 0
     let twos = 0
     for (const num of nums) {
-        ones = (ones ^ num) & (~twos)
-        twos = (twos ^ num) & (~ones)
+        ones = (ones ^ num) & ~twos
+        twos = (twos ^ num) & ~ones
     }
     return ones
 }

src/test/ts/g0101_0200/s0129_sum_root_to_leaf_numbers/solution.test.ts

@@ -4,9 +4,9 @@ import { sumNumbers } from 'src/main/ts/g0101_0200/s0129_sum_root_to_leaf_number
 import { expect, test } from 'vitest'
 
 test('sumNumbers', () => {
-    expect(sumNumbers(createTreeNode([1,2,3]))).toEqual(25)
+    expect(sumNumbers(createTreeNode([1, 2, 3]))).toEqual(25)
 })
 
 test('sumNumbers2', () => {
-    expect(sumNumbers(createTreeNode([4,9,0,5,1]))).toEqual(1026)
+    expect(sumNumbers(createTreeNode([4, 9, 0, 5, 1]))).toEqual(1026)
 })