From b1c11da763c2679585dbe874b3a8102f025e45e8 Mon Sep 17 00:00:00 2001
From: narender08 <56318863+narender08@users.noreply.github.com>
Date: Sat, 23 Oct 2021 11:45:54 +0530
Subject: [PATCH] Create addtwoLinklist

---
 addtwoLinklist | 196 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 196 insertions(+)
 create mode 100644 addtwoLinklist

diff --git a/addtwoLinklist b/addtwoLinklist
new file mode 100644
index 0000000..86c747d
--- /dev/null
+++ b/addtwoLinklist
@@ -0,0 +1,196 @@
+// A C++ recursive program to add two linked lists
+#include <bits/stdc++.h>
+using namespace std;
+
+// A linked List Node
+class Node {
+public:
+	int data;
+	Node* next;
+};
+
+typedef Node node;
+
+/* A utility function to insert
+a node at the beginning of linked list */
+void push(Node** head_ref, int new_data)
+{
+	/* allocate node */
+	Node* new_node = new Node[(sizeof(Node))];
+
+	/* put in the data */
+	new_node->data = new_data;
+
+	/* link the old list off the new node */
+	new_node->next = (*head_ref);
+
+	/* move the head to point to the new node */
+	(*head_ref) = new_node;
+}
+
+/* A utility function to print linked list */
+void printList(Node* node)
+{
+	while (node != NULL) {
+		cout << node->data << " ";
+		node = node->next;
+	}
+	cout << endl;
+}
+
+// A utility function to swap two pointers
+void swapPointer(Node** a, Node** b)
+{
+	node* t = *a;
+	*a = *b;
+	*b = t;
+}
+
+/* A utility function to get size of linked list */
+int getSize(Node* node)
+{
+	int size = 0;
+	while (node != NULL) {
+		node = node->next;
+		size++;
+	}
+	return size;
+}
+
+// Adds two linked lists of same size
+// represented by head1 and head2 and returns
+// head of the resultant linked list. Carry
+// is propagated while returning from the recursion
+node* addSameSize(Node* head1, Node* head2, int* carry)
+{
+	// Since the function assumes linked lists are of same
+	// size, check any of the two head pointers
+	if (head1 == NULL)
+		return NULL;
+
+	int sum;
+
+	// Allocate memory for sum node of current two nodes
+	Node* result = new Node[(sizeof(Node))];
+
+	// Recursively add remaining nodes and get the carry
+	result->next
+		= addSameSize(head1->next, head2->next, carry);
+
+	// add digits of current nodes and propagated carry
+	sum = head1->data + head2->data + *carry;
+	*carry = sum / 10;
+	sum = sum % 10;
+
+	// Assigne the sum to current node of resultant list
+	result->data = sum;
+
+	return result;
+}
+
+// This function is called after the
+// smaller list is added to the bigger
+// lists's sublist of same size. Once the
+// right sublist is added, the carry
+// must be added toe left side of larger
+// list to get the final result.
+void addCarryToRemaining(Node* head1, Node* cur, int* carry,
+						Node** result)
+{
+	int sum;
+
+	// If diff. number of nodes are not traversed, add carry
+	if (head1 != cur) {
+		addCarryToRemaining(head1->next, cur, carry,
+							result);
+
+		sum = head1->data + *carry;
+		*carry = sum / 10;
+		sum %= 10;
+
+		// add this node to the front of the result
+		push(result, sum);
+	}
+}
+
+// The main function that adds two linked lists
+// represented by head1 and head2. The sum of
+// two lists is stored in a list referred by result
+void addList(Node* head1, Node* head2, Node** result)
+{
+	Node* cur;
+
+	// first list is empty
+	if (head1 == NULL) {
+		*result = head2;
+		return;
+	}
+
+	// second list is empty
+	else if (head2 == NULL) {
+		*result = head1;
+		return;
+	}
+
+	int size1 = getSize(head1);
+	int size2 = getSize(head2);
+
+	int carry = 0;
+
+	// Add same size lists
+	if (size1 == size2)
+		*result = addSameSize(head1, head2, &carry);
+
+	else {
+		int diff = abs(size1 - size2);
+
+		// First list should always be larger than second
+		// list. If not, swap pointers
+		if (size1 < size2)
+			swapPointer(&head1, &head2);
+
+		// move diff. number of nodes in first list
+		for (cur = head1; diff--; cur = cur->next)
+			;
+
+		// get addition of same size lists
+		*result = addSameSize(cur, head2, &carry);
+
+		// get addition of remaining first list and carry
+		addCarryToRemaining(head1, cur, &carry, result);
+	}
+
+	// if some carry is still there, add a new node to the
+	// front of the result list. e.g. 999 and 87
+	if (carry)
+		push(result, carry);
+}
+
+// Driver code
+int main()
+{
+	Node *head1 = NULL, *head2 = NULL, *result = NULL;
+
+	int arr1[] = { 9, 9, 9 };
+	int arr2[] = { 1, 8 };
+
+	int size1 = sizeof(arr1) / sizeof(arr1[0]);
+	int size2 = sizeof(arr2) / sizeof(arr2[0]);
+
+	// Create first list as 9->9->9
+	int i;
+	for (i = size1 - 1; i >= 0; --i)
+		push(&head1, arr1[i]);
+
+	// Create second list as 1->8
+	for (i = size2 - 1; i >= 0; --i)
+		push(&head2, arr2[i]);
+
+	addList(head1, head2, &result);
+
+	printList(result);
+
+	return 0;
+}
+
+// This code is contributed by rathbhupendra