//1. 给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
//示例:输入: 1->1->2->3->3;输出: 1->2->3
ListNode* find(ListNode* head1,ListNode* head2)
{
ListNode* p1 = head1;
ListNode* p2 = head2;
ListNode* head = new ListNode;
ListNode* pre = head;
while(p1||p2)
{
if(p1 == NULL)
pre->next = p2;
else if(p2 == NULL)
pre->next = p1;
else if(p1->value < p2->value)
{
pre->next = p1;
p1 = p1->next;
}
else if(p1->value > p2->value)
{
pre->next = p2;
p2 = p2->next;
}
pre = pre->next;
}