careercup2.4

/*You have two numbers represented by a linked list, where each node contains a sin-
gle digit   The digits are stored in reverse order, such that the 1’s digit is at the head of 
the list   Write a function that adds the two numbers and returns the sum as a linked 
list 
EXAMPLE  
Input: (3 -> 1 -> 5) + (5 -> 9 -> 2)
Output: 8 -> 0 -> 8
*/
#include <iostream>
using namespace std;
class Node{
public:
	int data;
    Node* next;
	Node(){this->next = 0;}
	Node(int a):data(a),next(0){}
};

class LinkList{
public:
	Node* head;
	Node* tail;

	LinkList(){ 
	   head = new Node(-1); 
	   tail = head;
	}
	LinkList(int ar[],int len){
		head = new Node(-1);
		tail = head;
		for(int i = 0; i<len; i++){
			tail->next = new Node(ar[i]);
		    tail = tail->next;
	    }
	}

	void insertion(int);
	Node* del(int i);
	void print()const{
		Node* p = head->next;
		 while(p)
		{
		  cout<<p->data<<" ";
		  p = p->next;
		  }
	}
};

void LinkList::insertion(int k){
	tail->next = new Node(k);
	tail = tail->next;
}

Node* LinkList::del(int i){
	Node* p = head->next;
	Node* k = head;
	while(p->data != i){
		k = p;
		p = p->next;
	}
	k->next = p->next;
	delete(p);
	return p->next;
}

LinkList add(LinkList a, LinkList b){
	Node* ah = a.head->next;
	Node* bh = b.head->next;
	LinkList c;
	int m = 0,n;

	while(ah != 0 && bh != 0){
		n = (ah->data + bh->data + m)%10;
		c.insertion(n);
		m = (ah->data + bh->data + m)/10;
		ah = ah->next;
		bh = bh->next;
	}
	if(ah == 0)
		while(bh != 0){
			n = (bh->data + m)%10;
			c.insertion(n);
			m = (bh->data + m)/10;
			bh = bh->next;
		}else while(ah != 0){
			n = (ah->data + m)%10;
			c.insertion(n);
			m = (ah->data + m)/10;
			ah = ah->next;
		}
	if(m == 1)
		c.insertion(1);
		return c;
}

int main(){
	int ar[]={1,3,5,8};
	int br[]={2,9,2,3,9}; 
	LinkList a(ar,4);
	LinkList b(br,5);
	LinkList c= add(a,b);
	c.print();
}