Merge pull request #159 from myoshi2891/dev/macbook_pro

Dev/macbook pro

Author: myoshi2891

DataStructures/LinkedLists/leetcode/2. Add Two Numbers/AddTwoNumbers.ts

@@ -1,30 +1,35 @@
+export {};
+
 class ListNode {
-    val: number;
-    next: ListNode | null;
+  val: number;
+  next: ListNode | null;
 
-    constructor(val?: number, next?: ListNode | null) {
-        this.val = val ?? 0;
-        this.next = next ?? null;
-    }
+  constructor(val?: number, next?: ListNode | null) {
+    this.val = val ?? 0;
+    this.next = next ?? null;
+  }
 }
 
-function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | null {
-    const dummyHead = new ListNode(0);
-    let current = dummyHead;
-    let carry = 0;
+function addTwoNumbers(
+  l1: ListNode | null,
+  l2: ListNode | null
+): ListNode | null {
+  const dummyHead = new ListNode(0);
+  let current = dummyHead;
+  let carry = 0;
 
-    while (l1 !== null || l2 !== null || carry > 0) {
-        const val1 = l1?.val ?? 0;
-        const val2 = l2?.val ?? 0;
-        const sum = val1 + val2 + carry;
+  while (l1 !== null || l2 !== null || carry > 0) {
+    const val1 = l1?.val ?? 0;
+    const val2 = l2?.val ?? 0;
+    const sum = val1 + val2 + carry;
 
-        carry = Math.floor(sum / 10);
-        current.next = new ListNode(sum % 10);
-        current = current.next;
+    carry = Math.floor(sum / 10);
+    current.next = new ListNode(sum % 10);
+    current = current.next;
 
-        l1 = l1?.next ?? null;
-        l2 = l2?.next ?? null;
-    }
+    l1 = l1?.next ?? null;
+    l2 = l2?.next ?? null;
+  }
 
-    return dummyHead.next;
+  return dummyHead.next;
 }