Discussion on Compare two linked lists Challenge

Sort 880 Discussions, By:

14 hours ago+ 0 comments

JAVA code static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {

    SinglyLinkedListNode tmp1 = head1;
    SinglyLinkedListNode tmp2 = head2 ;
    boolean isSame= true;
    while(tmp1!=null && tmp2 !=null){
        if(tmp1.data != tmp2.data){
            isSame=false;
            break;
        }
        tmp1=tmp1.next;
        tmp2=tmp2.next;
    }
    if(tmp1!=null || tmp2!=null){
        isSame=false;
    }
    return isSame;

}

4 days ago+ 0 comments

Python super easy

def compare_lists(llist1, llist2):
    while llist1 and llist2:
        if llist1.data==llist2.data:
            llist1,llist2=llist1.next,llist2.next
        else:
            return 0
    if not llist1 and not llist2:
        return 1
    else:
        return 0

5 days ago+ 0 comments

python

def compare_lists(llist1, llist2):
    if llist1 is None and llist2 is None:
        return 1
    if llist1 is None or llist2 is None:
        return 0
    if llist1.data != llist2.data:
        return 0
    return compare_lists(llist1.next,llist2.next)

1 week ago+ 0 comments

My solution with C++

bool compare_lists(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {
    auto p1=head1; auto p2 = head2;
    while (p1!=nullptr&&p2!=nullptr&&p1->data==p2->data)
    {
            p1 = p1->next;
            p2 = p2->next;
    }
    
    if (p1==nullptr&&p2==nullptr) return 1;
    else return 0;
}

1 week ago+ 0 comments

Python 3

def compare_lists(llist1, llist2):
    while llist1 or llist2:
        try:
            if llist1.data != llist2.data:
                return 0
        except AttributeError:
            return 0
        llist1, llist2 = llist1.next, llist2.next
    return 1

Load more conversations