问题
I have some C code, where in there are two linked lists(say A and B) and A is inserted at a particular position into B and A still has elements.
How do I simulate the same behavior effectively using the C++ STL? If I try splice, it makes the second one empty.
Thanks, Gokul.
回答1:
You need to copy the elements. Consider something like this:
std::copy(a.begin(), a.end(), std::inserter(b, b_iterator));
If you want the same nodes shared by two lists, this is simply not supported by std::list (STL containers always have exclusive ownership). You can avoid duplicating the elements by storing pointers in the list, or by using boost::ptr_list, which internally stores pointers but offers a nicer API.
回答2:
Try insert:
B.insert( position, A.begin(), A.end() );
to insert copies of the elements of A in B before 'position'. A itself remains unchanged. See this link
来源：https://stackoverflow.com/questions/2349098/c-linked-list-behavior