fork(2) download

#include <iostream>
#include <unordered_set>
using namespace std;
 
struct Node
   {
       int data;
       Node* next;
   };
 
int FindMergeNode_Hash(Node *headA, Node *headB);
 
int main()
{
    Node *a = new Node();
    Node *b = new Node();
    Node *c = new Node();
    Node *d = new Node();
    Node *e = new Node();
    Node *f = new Node();
    Node *g = new Node();
 
    a->data=1;
    a->next=b;
 
    b->data=2;
    b->next=c;
 
    c->data=3;
    c->next=d;
 
    d->data=4; // Meeting Point
    d->next=e;
 
    e->data=5;
    e->next=f;
 
    f->data=6;
    f->next=g;
 
    g->data=7;
    g->next=NULL;
 
    Node *A = new Node();
    Node *B = new Node();
    Node *C = new Node();
 
    A->data = 11;
    A->next = B;
 
    B->data = 12;
    B->next = C;
 
    C->data = 13;
    C->next = d;
 
    int ans = FindMergeNode_Hash(A, a);
    cout<<"Lists meet at "<<ans<<"\n";
    return 0;
}
 
int FindMergeNode_Hash(Node *headA, Node *headB)
{
    unordered_set<Node*> h;
    while(headA->next)
    {
        h.insert(&headA);
        headA = headA->next;
    }
    while(headB->next)
    {
        unordered_set <Node*>::iterator got = h.find (&headB);
        if ( got != h.end() )
            return headB->data;
    }
    return -1;
}

prog.cpp: In function ‘int FindMergeNode_Hash(Node*, Node*)’:
prog.cpp:67:24: error: no matching function for call to ‘std::unordered_set<Node*>::insert(Node**)’
         h.insert(&headA);
                        ^
In file included from /usr/include/c++/6/unordered_set:48:0,
                 from prog.cpp:2:
/usr/include/c++/6/bits/unordered_set.h:412:7: note: candidate: std::pair<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator, bool> std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(const value_type&) [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator = std::__detail::_Node_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = Node*]
       insert(const value_type& __x)
       ^~~~~~
/usr/include/c++/6/bits/unordered_set.h:412:7: note:   no known conversion for argument 1 from ‘Node**’ to ‘Node* const&’
/usr/include/c++/6/bits/unordered_set.h:416:7: note: candidate: std::pair<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator, bool> std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type&&) [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator = std::__detail::_Node_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = Node*]
       insert(value_type&& __x)
       ^~~~~~
/usr/include/c++/6/bits/unordered_set.h:416:7: note:   no known conversion for argument 1 from ‘Node**’ to ‘Node*&&’
/usr/include/c++/6/bits/unordered_set.h:441:7: note: candidate: std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator, const value_type&) [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Node_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Node_const_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = Node*]
       insert(const_iterator __hint, const value_type& __x)
       ^~~~~~
/usr/include/c++/6/bits/unordered_set.h:441:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/6/bits/unordered_set.h:445:7: note: candidate: std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator, std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type&&) [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Node_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Node_const_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = Node*]
       insert(const_iterator __hint, value_type&& __x)
       ^~~~~~
/usr/include/c++/6/bits/unordered_set.h:445:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/6/bits/unordered_set.h:460:2: note: candidate: template<class _InputIterator> void std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>]
  insert(_InputIterator __first, _InputIterator __last)
  ^~~~~~
/usr/include/c++/6/bits/unordered_set.h:460:2: note:   template argument deduction/substitution failed:
prog.cpp:67:24: note:   candidate expects 2 arguments, 1 provided
         h.insert(&headA);
                        ^
In file included from /usr/include/c++/6/unordered_set:48:0,
                 from prog.cpp:2:
/usr/include/c++/6/bits/unordered_set.h:471:7: note: candidate: void std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::initializer_list<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::value_type>) [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::value_type = Node*]
       insert(initializer_list<value_type> __l)
       ^~~~~~
/usr/include/c++/6/bits/unordered_set.h:471:7: note:   no known conversion for argument 1 from ‘Node**’ to ‘std::initializer_list<Node*>’
prog.cpp:72:61: error: no matching function for call to ‘std::unordered_set<Node*>::find(Node**)’
         unordered_set <Node*>::iterator got = h.find (&headB);
                                                             ^
In file included from /usr/include/c++/6/unordered_set:48:0,
                 from prog.cpp:2:
/usr/include/c++/6/bits/unordered_set.h:585:7: note: candidate: std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator std::unordered_set<_Value, _Hash, _Pred, _Alloc>::find(const key_type&) [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Node_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::key_type = Node*]
       find(const key_type& __x)
       ^~~~
/usr/include/c++/6/bits/unordered_set.h:585:7: note:   no known conversion for argument 1 from ‘Node**’ to ‘Node* const&’
/usr/include/c++/6/bits/unordered_set.h:589:7: note: candidate: std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator std::unordered_set<_Value, _Hash, _Pred, _Alloc>::find(const key_type&) const [with _Value = Node*; _Hash = std::hash<Node*>; _Pred = std::equal_to<Node*>; _Alloc = std::allocator<Node*>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Node_const_iterator<Node*, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::key_type = Node*]
       find(const key_type& __x) const
       ^~~~
/usr/include/c++/6/bits/unordered_set.h:589:7: note:   no known conversion for argument 1 from ‘Node**’ to ‘Node* const&’

Standard output is empty