{"id":27692,"date":"2018-04-09T20:21:09","date_gmt":"2018-04-09T14:51:09","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27692"},"modified":"2018-09-11T19:41:16","modified_gmt":"2018-09-11T14:11:16","slug":"cpp-programming-compare-two-strings-represented-as-linked-lists","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/cpp-programming-compare-two-strings-represented-as-linked-lists\/","title":{"rendered":"Cpp programming-Compare two strings represented as linked lists"},"content":{"rendered":"

Given two linked lists, represented as linked lists (every character is a node in linked list). Write a function compare() that works similar to strcmp(), i.e., it returns 0 if both strings are same, 1 if first linked list is lexicographically greater, and -1 if second string is lexicographically greater.<\/p>\n

Examples:<\/strong><\/p>\n

Input: list1 = g->e->e->k->s->a\r\n       list2 = g->e->e->k->s->b\r\nOutput: -1\r\n\r\nInput: list1 = g->e->e->k->s->a\r\n       list2 = g->e->e->k->s\r\nOutput: 1\r\n\r\nInput: list1 = g->e->e->k->s\r\n       list2 = g->e->e->k->s\r\nOutput: 0\r\n\r\n<\/pre>\n
c++ programming<\/strong><\/p>\n
 
 <\/div> 
\/\/ C++ program to compare two strings represented as linked \/\/ lists#include<bits\/stdc++.h>using namespace std;  \/\/ Linked list Node structurestruct Node{    char c;    struct Node *next;};  \/\/ Function to create newNode in a linkedlistNode* newNode(char c){    Node *temp = new Node;    temp->c = c;    temp->next = NULL;    return temp;}; int compare(Node *list1, Node *list2) {        \/\/ Traverse both lists. Stop when either end of a linked     \/\/ list is reached or current characters don't match    while (list1 && list2 && list1->c == list2->c)     {                 list1 = list1->next;        list2 = list2->next;    }         \/\/  If both lists are not empty, compare mismatching    \/\/  characters    if (list1 && list2)         return (list1->c > list2->c)? 1: -1;     \/\/ If either of the two lists has reached end    if (list1 && !list2) return 1;    if (list2 && !list1) return -1;         \/\/ If none of the above conditions is true, both     \/\/ lists have reached end     return 0;} \/\/ Driver programint main(){    Node *list1 = newNode('g');    list1->next = newNode('e');    list1->next->next = newNode('e');    list1->next->next->next = newNode('k');    list1->next->next->next->next = newNode('s');    list1->next->next->next->next->next = newNode('b');     Node *list2 = newNode('g');    list2->next = newNode('e');    list2->next->next = newNode('e');    list2->next->next->next = newNode('k');    list2->next->next->next->next = newNode('s');    list2->next->next->next->next->next = newNode('a');     cout << compare(list1, list2);      return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
1<\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
Compare two strings represented as linked lists-Linked list
\nGiven two linked lists, represented as linked lists (every character is a node <\/p>\n","protected":false},"author":1,"featured_media":31266,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79476,79478],"tags":[81987,81981,81979,81984,81980,81985,81983,81986,81982],"class_list":["post-27692","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-linked-list","category-singly-linked-list","tag-add-two-numbers-represented-by-linked-lists","tag-c-linked-list-string-example","tag-compare-two-linked-list-in-c","tag-compare-two-linked-lists-hackerrank-solution","tag-compare-two-linked-lists-java","tag-how-would-you-detect-a-loop-in-a-linked-list","tag-insert-string-into-linked-list-in-c","tag-merge-two-sorted-linked-lists","tag-string-linked-list-java"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27692","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27692"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27692\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/31266"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27692"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27692"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27692"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}