FilesExpand file tree

 main

/

2-Add-Two-Numbers.c

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

67 lines (53 loc) · 1.56 KB

 main

/

2-Add-Two-Numbers.c

Top

File metadata and controls

• Code
• Blame

67 lines (53 loc) · 1.56 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

/*

Given two linked lists where the nodes represent the digits of two numbers,

add the numbers together and return the sum as a linked list.

Ex. l1 = [2,4,3],

l2 = [5,6,4] -> [7,0,8]

Traverse the linked lists and add the values of the corresponding nodes, if

the sum is greater than 10, carry is present and will be added along with

the next pair of digits. The lengths of the lists may differ, so check if

the nodes are not null, before adding.

Time: O(max(m, n)) where m, n are lengths of l1 and l2 respectively

Space: O(max(m, n))

*/

/**

* Definition for singly-linked list.

* struct ListNode {

* int val;

* struct ListNode *next;

* };

*/

struct ListNode* newNode(int val) {

struct ListNode* node = (struct ListNode*) malloc(sizeof(struct ListNode));

node->val = val;

node->next = NULL;

return node;

}

struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){

struct ListNode* head = NULL;

struct ListNode* curr = NULL;

int carry = 0;

while (l1 || l2) {

int sum = carry;

if (l1)

sum += l1->val;

if (l2)

sum += l2->val;

carry = sum/10;

sum %= 10;

if (head == NULL) {

head = newNode(sum);

curr = head;

} else {

curr->next = newNode(sum);

curr = curr->next;

}

if (l1)

l1 = l1->next;

if (l2)

l2 = l2->next;

}

if (carry)

curr->next = newNode(carry);

return head;

}