C++11 删除链表重复数值

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87

#include <memory> #include <iostream> #include <chrono> #include <thread> using namespace std;   struct ListNode{     int val;     shared_ptr<ListNode> next; };   bool InsertNode(shared_ptr<ListNode>& insertPos,int val) {     shared_ptr<ListNode> node(new ListNode);     if (!node)         return false;     node->val = val;     node->next = NULL;     insertPos->next = node;     insertPos = node;       return true; }   bool  InitLinkList(shared_ptr<ListNode>& head) {     if ( (!head) || NULL != head->next )         return false;       head->val = 1;     shared_ptr<ListNode> tail = head;       InsertNode(tail, 1);     InsertNode(tail, 2);     InsertNode(tail, 3);     InsertNode(tail, 3);         return true; }   void CoutLinkList(const shared_ptr<ListNode>& head) {     for (shared_ptr<ListNode> node = head;         node; node = node->next)     {         cout << node->val << " ";     }     cout << endl; }   shared_ptr<ListNode>  removeDuplicates(shared_ptr<ListNode>& head) {     if (head == NULL)     {         return NULL;     }       shared_ptr<ListNode> node = head;     while(node->next != NULL){         if(node->val == node->next->val){             shared_ptr<ListNode> tmp = node->next;             node->next = node->next->next;         }else         {             node = node->next;         }     }     return head; }         int main() {     shared_ptr<ListNode> head(new ListNode);     InitLinkList(head);       CoutLinkList(head);       head = removeDuplicates(head);       CoutLinkList(head);       return 0; }