Li_peipei的博客

Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. #include #include typedef

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.#include #include #include typedef int ElemType; typedef