Discussion on Compare two linked lists Challenge

Sort 619 Discussions, By:

yujinred 5 years ago+ 0 comments

Here is my solution in C++. It's pretty simple.

if (headA == NULL && headB == NULL) {
	return 1;
} else if (headA == NULL || headB == NULL) {
	return 0;
}

if (headA->data == headB->data) {
	return CompareLists(headA->next, headB->next);
} else {
	return 0;
}

PsychicPhoenix 4 years ago+ 0 comments

int CompareLists(Node headA, Node headB) {
    while( headA != null && headB != null &&headA.data == headB.data){
             headA = headA.next;
             headB = headB.next;
        }
    return (headA == headB)? 1 : 0;
 
}

zed1g 5 years ago+ 0 comments

int CompareLists(Node *h1, Node *h2) {
    while (h1 && h2 && (h1->data == h2->data)) {
        h1 = h1->next;
        h2 = h2->next;
    }
    return h1 == h2;
}

EduardoLeggiero 5 years ago+ 0 comments

Solved with recursion:

int CompareLists(Node headA, Node headB) {
    if (headA == null && headB == null) {
        return 1;
    }
    if (headA == null || headB == null || headA.data != headB.data) {
        return 0;
    }
    return CompareLists(headA.next, headB.next);
}

ashutosh310599 6 months ago+ 0 comments

java 8 solution:-

static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
        if(head1==null&&head2==null) return true;
        if(head1==null||head2==null) return false;
        if(head1.data==head2.data)
         return compareLists(head1.next,head2.next);
         return false;
    }

Load more conversations