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
.
移除单链表中重复的节点
public class Solution {
public ListNode DeleteDuplicates(ListNode head) {
if (head == null)
{
return null;
}
ListNode node = head;
ListNode nextNode = null;
while (node.next != null)
{
if (node.val == node.next.val)
{
nextNode = node.next;
while (nextNode.val == node.val)
{
if (nextNode.next == null)
{
node.next = null;
return head;
}
else
{
nextNode = nextNode.next;
}
}
node.next = nextNode;
node = nextNode;
}
else
{
node = node.next;
}
}
return head;
}
}
public class Solution {
if (head == null) return head;
ListNode node = head;
while (node.next != null)
{
if (node.val == node.next.val)
{
node.next = node.next.next;
}
else
{
node = node.next;
}
}
return head;
}
}
大牛的递归版本
https://discuss.leetcode.com/topic/14775/3-line-java-recursive-solution
时间: 2024-12-19 08:07:40