new node added

Author: arorarahul

README.md

@@ -66,6 +66,7 @@ TODO:
 - program to add, mult, subtract two numbers stored in two different linked list and store the result in another linked list
 - storing addresses of a linked list in hash table
 - storing addresses of a linked list in stack and doing operations
+- hash table implementation of question12 to be done
 
 
 ### General Questions

linked-lists/question12.c

@@ -47,6 +47,100 @@ Time complexity: O(n)
 Space complexity: O(1)
 */
 
+//METHOD1
+// #include <stdio.h>
+// #include <stdlib.h>
+
+// struct node{
+// 	int data;
+// 	struct node *arb;
+// 	struct node *link;
+// };
+
+// void makeList(struct node *t, int maxCounter, int mul){
+// 	int counter = 1;
+// 	struct node *temp = t;
+// 	while(counter <=maxCounter){
+// 		t->data = counter*mul;
+// 		if(counter == maxCounter){
+// 			t->link = NULL;	
+// 		}else{
+// 			t->link = (struct node *)malloc(sizeof(struct node));	
+// 		}
+// 		t = t->link;
+// 		counter++;
+// 	}
+// 	counter = 1;
+// 	t = temp;
+// 	while(counter <=maxCounter){
+// 		if(t && t->link && t->link->link){
+// 			t->arb = t->link->link;
+// 		}else if(t && t->link){
+// 			t->arb = t->link;
+// 		}
+// 		else if(temp->link){
+// 			t->arb = temp->link;
+// 		}	
+// 		t=t->link;
+// 		counter++;
+// 	}
+// }
+
+// void cloneList(struct node *head, struct node *clone){
+// 	for(;head; head=head->link, clone=clone->link){
+// 		clone->data = head->data;
+// 		if(head->link == NULL){
+// 			clone->link = NULL;
+// 		}else{
+// 			clone->link = (struct node *)malloc(sizeof(struct node));	
+// 		}
+// 	}
+// }
+
+// void printList(struct node *head){
+// 	if(head){
+// 		printf("(%d, %p) -->", head->data, head->arb);
+// 		printList(head->link);
+// 	}
+// 	printf("\n");
+// }
+
+// struct node *findPtrInClone(int val, struct node *clone){
+// 	for(;clone; clone=clone->link){
+// 		if(clone->data == val){
+// 			return clone;
+// 		}
+// 	}
+// 	return NULL;
+// }
+
+// void assignArb(struct node *head, struct node *clone){
+// 	int val, cloneVal;
+// 	struct node *clonehead = clone;
+// 	for(;head;head=head->link,clone=clone->link){
+// 		val = head->arb->data;
+// 		struct node *temp = findPtrInClone(val, clonehead);
+// 		clone->arb = temp;
+// 	}
+// }
+
+// int main(){
+
+// 	struct node *head = (struct node *)malloc(sizeof(struct node));
+// 	struct node *t = head;
+// 	makeList(t,8,100);
+// 	printList(head);
+// 	struct node *clone = (struct node *)malloc(sizeof(struct node));
+// 	cloneList(head, clone);
+// 	assignArb(head,clone);
+// 	printList(clone);
+// }
+
+//================================================================================================
+//METHOD2: hash table to be done later
+//METHOD3: coming soon
+
+//METHOD4
 #include <stdio.h>
 #include <stdlib.h>
 
@@ -85,53 +179,57 @@ void makeList(struct node *t, int maxCounter, int mul){
 	}
 }
 
-void cloneList(struct node *head, struct node *clone){
-	for(;head; head=head->link, clone=clone->link){
-		clone->data = head->data;
-		if(head->link == NULL){
-			clone->link = NULL;
-		}else{
-			clone->link = (struct node *)malloc(sizeof(struct node));	
-		}
+void cloneList(struct node *head){
+	struct node *temp = head;
+	while(temp){
+		struct node *clone = (struct node *)malloc(sizeof(struct node));
+		clone->data = temp->data;
+		clone->link = temp->link;
+		temp->link = clone;
+		temp = clone->link;
+	}
+}
+
+void setRandomNode(struct node *t1){
+	while(t1){
+		t1->link->arb = t1->arb->link;
+		t1=t1->link->link;
 	}
+
 }
 
 void printList(struct node *head){
 	if(head){
-		printf("(%d, %p) -->", head->data, head->arb);
+		printf("(%d,%p) -->", head->data, head->arb);
 		printList(head->link);
 	}
 	printf("\n");
 }
 
-struct node *findPtrInClone(int val, struct node *clone){
-	for(;clone; clone=clone->link){
-		if(clone->data == val){
-			return clone;
-		}
-	}
-	return NULL;
-}
-
-void assignArb(struct node *head, struct node *clone){
-	int val, cloneVal;
-	struct node *clonehead = clone;
-	for(;head;head=head->link,clone=clone->link){
-		val = head->arb->data;
-		struct node *temp = findPtrInClone(val, clonehead);
-		clone->arb = temp;
+struct node *separateClonedList(struct node *head1, struct node *head2){
+	struct node *temp = head2;
+	for(;head1 && head2 && head1->link && head2->link;
+		head1=head1->link, head2=head2->link){
+		
+		head1->link = head2->link;
+		head2->link = head2->link->link;
 	}
+	head1->link = head2->link = NULL;
+	return temp;
 }
 
 int main(){
-
 	struct node *head = (struct node *)malloc(sizeof(struct node));
 	struct node *t = head;
 	makeList(t,8,100);
+	// printList(head);
+	cloneList(head);
+	// printList(head);
+	setRandomNode(head);
 	printList(head);
-	struct node *clone = (struct node *)malloc(sizeof(struct node));
-	cloneList(head, clone);
-	assignArb(head,clone);
-	printList(clone);
-}	
 
+	struct node *clone = separateClonedList(head, head->link);
+
+	printList(head);
+	printList(clone);
+}