Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return . Otherwise, return .

Example

The two lists have equal data attributes for the first nodes. is longer, though, so the lists are not equal. Return .

Function Description

Complete the compare_lists function in the editor below.

compare_lists has the following parameters:

SinglyLinkedListNode llist1: a reference to the head of a list
SinglyLinkedListNode llist2: a reference to the head of a list

Returns

int: return 1 if the lists are equal, or 0 otherwise

Input Format

The first line contains an integer , the number of test cases.

Each of the test cases has the following format:
The first line contains an integer , the number of nodes in the first linked list.
Each of the next lines contains an integer, each a value for a data attribute.
The next line contains an integer , the number of nodes in the second linked list.
Each of the next lines contains an integer, each a value for a data attribute.

Output Format

Compare the two linked lists and return 1 if the lists are equal. Otherwise, return 0. Do NOT print anything to stdout/console.

The output is handled by the code in the editor and it is as follows:

For each test case, in a new line, print if the two lists are equal, else print .

Sample Input

Sample Output

0
1


Solution

#include <bits/stdc++.h>

using namespace std;

class SinglyLinkedListNode {

public:

int data;

SinglyLinkedListNode *next;

SinglyLinkedListNode(int node_data) {

this->data = node_data;

this->next = nullptr;

}

};

class SinglyLinkedList {

public:

SinglyLinkedListNode *head;

SinglyLinkedListNode *tail;

SinglyLinkedList() {

this->head = nullptr;

this->tail = nullptr;

}

void insert_node(int node_data) {

SinglyLinkedListNode* node = new SinglyLinkedListNode(node_data);

if (!this->head) {

this->head = node;

} else {

this->tail->next = node;

}

this->tail = node;

}

};

void print_singly_linked_list(SinglyLinkedListNode* node, string sep, ofstream& fout) {

while (node) {

fout << node->data;

node = node->next;

if (node) {

fout << sep;

}

void free_singly_linked_list(SinglyLinkedListNode* node) {

while (node) {

SinglyLinkedListNode* temp = node;

node = node->next;

free(temp);

}

// Complete the compare_lists function below.

* For your reference:

* SinglyLinkedListNode {

* int data;

* SinglyLinkedListNode* next;

* };

bool compare_lists(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {

SinglyLinkedListNode* l1 = head1;

SinglyLinkedListNode* l2 = head2;

while (l1 || l2) {

if (!l1 || !l2) return false;

if (l1->data != l2->data) return false; // Different data?

l1 = l1->next;

l2 = l2->next;

}

return true;

}

int main()

{

ofstream fout(getenv("OUTPUT_PATH"));

int tests;

cin >> tests;