FilesExpand file tree

 master

/

AddTwoNumbers.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (51 loc) · 1.43 KB

 master

/

AddTwoNumbers.js

Copy path

Top

File metadata and controls

• Code
• Blame

59 lines (51 loc) · 1.43 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

/**

* A LinkedList based solution for Add Two Numbers

*

*/

import { Node } from './SinglyLinkedList.js'

/*

Problem Statement:

Given two non-empty linked lists representing two non-negative integers.

The digits are stored in reverse order and each of their nodes contain a single digit.

Add the two numbers and return it as a linked list.

Link for the Problem: https://leetcode.com/problems/add-two-numbers/

*/

class AddTwoNumbers {

constructor () {

this.dummyNode = new Node(0)

}

solution (firstList, secondList) {

let firstRunner = firstList

let secondRunner = secondList

let tail = this.dummyNode

let carry = 0

while (firstRunner != null || secondRunner != null) {

const firstNumber = firstRunner ? firstRunner.data : 0

const secondNumber = secondRunner ? secondRunner.data : 0

const sum = carry + firstNumber + secondNumber

carry = parseInt(sum / 10)

tail.next = new Node(sum % 10)

tail = tail.next

if (firstRunner) {

firstRunner = firstRunner.next

}

if (secondRunner) {

secondRunner = secondRunner.next

}

}

if (carry > 0) {

tail.next = new Node(carry % 10)

}

return this.dummyNode.next

}

solutionToArray () {

const list = []

let currentNode = this.dummyNode.next

while (currentNode) {

list.push(currentNode.data)

currentNode = currentNode.next

}

return list

}

}

export { AddTwoNumbers }