/* Single Digit Addition [each node must have single digit] Input Format for (2,4,3) + (5,6) input as follows(use space seperated number) 3 2 2 4 3 5 6 [a_n1 b_n2 a1 a2 a3 b1 b2 ] 5 5 1 2 3 4 5 9 9 9 9 9 // for n1 == n2 2 5 1 2 9 9 9 9 9 // for n1 < n2 5 2 1 2 3 4 5 9 9 // for n1 > n2 0 5 9 9 9 9 9 // for n1 == 0, n2 != 0 5 0 9 9 9 9 9 // for n1 != 0, n2 == 0 */ #include using namespace std; struct node { int data; node *next; }; class linked_list { private: node *head, *tail; public: linked_list() { head = NULL; tail = NULL; } void add_node(int n) { node *tmp = new node; tmp -> data = n; tmp -> next = NULL; if(head == NULL) { head = tmp; tail = tmp; } else { tail -> next = tmp; tail = tail -> next; } } node* gethead() { return head; } void display(node *head) { if(head == NULL) { cout << "" << endl; } else { cout << head -> data << ", "; display(head -> next); } } }; void sum(node *h1, node *h2, int n1, int n2) { int i=0, j=0, cry=0, num; linked_list *l3 = new linked_list(); while(i data + h2 -> data + cry; l3 -> add_node(num % 10); if(num >= 10) cry = 1; else cry = 0; h1 = h1 -> next; h2 = h2 -> next; i++; j++; } while(i < n1) { num = h1 -> data + cry; l3 -> add_node(num % 10); if(num >= 10) cry = 1; else cry = 0; h1 = h1 -> next; i++; } while(j < n2) { num = h2 -> data + cry; l3 -> add_node(num % 10); if(num >= 10) cry = 1; else cry = 0; h2 = h2 -> next; j++; } if(cry != 0) l3 -> add_node(1); l3 -> display(l3 -> gethead()); } int main() { int n1, n2, tmp; cin >> n1 >> n2; linked_list *l1 = new linked_list(); linked_list *l2 = new linked_list(); for(int i=0; i< n1; i++) { cin >> tmp; l1 -> add_node(tmp); } for(int i=0; i< n2; i++) { cin >> tmp; l2 -> add_node(tmp); } cout << "Input List A: "; l1->display(l1->gethead()); cout << "Input List B: "; l2->display(l2->gethead()); cout << "ListA+List B: "; sum(l1->gethead(), l2->gethead(), n1, n2); return 0; }

Challenge: Add two num linked list