FilesExpand file tree

 master

/

AddTwoNumbers.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

77 lines (67 loc) · 2.04 KB

 master

/

AddTwoNumbers.java

Copy path

Top

File metadata and controls

• Code
• Blame

77 lines (67 loc) · 2.04 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

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

package math;

/**

* Created by gouthamvidyapradhan on 13/03/2017. You are 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.

*

* <p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.

*

* <p>Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8

*/

public class AddTwoNumbers {

public static class ListNode {

int val;

ListNode next;

ListNode(int x) {

val = x;

next = null;

}

}

public static void main(String[] args) {

ListNode node = new ListNode(2);

node.next = new ListNode(4);

node.next.next = new ListNode(4);

ListNode node1 = new ListNode(5);

node1.next = new ListNode(6);

node1.next.next = new ListNode(6);

ListNode result = new AddTwoNumbers().addTwoNumbers(node, node1);

}

private ListNode addTwoNumbers(ListNode l1, ListNode l2) {

if (l1 == null && l2 == null) return null;

ListNode first = l1;

ListNode second = l2;

int carry = 0;

ListNode head = new ListNode(0);

ListNode prev = head;

while (first != null && second != null) {

int q = (first.val + second.val + carry) / 10;

int r = (first.val + second.val + carry) % 10;

carry = q;

ListNode node = new ListNode(r);

prev.next = node;

prev = node;

first = first.next;

second = second.next;

}

while (first != null) {

int q = (first.val + carry) / 10;

int r = (first.val + carry) % 10;

carry = q;

ListNode node = new ListNode(r);

prev.next = node;

prev = node;

first = first.next;

}

while (second != null) {

int q = (second.val + carry) / 10;

int r = (second.val + carry) % 10;

carry = q;

ListNode node = new ListNode(r);

prev.next = node;

prev = node;

second = second.next;

}

if (carry != 0) prev.next = new ListNode(carry);

return head.next;

}

}