Problem:
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5
, return 1->2->5
.
Given 1->1->1->2->3
, return 2->3
.
遍历链表,对于每一个节点,先删除所有与之相同的后继结点,再决定是否删除该节点。时间复杂度为O(n),空间复杂度为O(1)。
Solution:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode h = new ListNode(-1);
h.next = head;
ListNode p = h;
while(p.next!=null)
{
if(p.next.next!=null&&p.next.next.val==p.next.val)
{
while(p.next.next!=null&&p.next.next.val==p.next.val)
{
p.next.next = p.next.next.next;
}
p.next = p.next.next;
}
else
{
p = p.next;
}
}
return h.next;
}
}
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode h = new ListNode(-1);
h.next = head;
ListNode p = h;
while(p.next!=null)
{
if(p.next.next!=null&&p.next.next.val==p.next.val)
{
while(p.next.next!=null&&p.next.next.val==p.next.val)
{
p.next.next = p.next.next.next;
}
p.next = p.next.next;
}
else
{
p = p.next;
}
}
return h.next;
}
}