题目:
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
.
分析:
这道题目中链表的表头元素不会发生改变,因此只需要考虑如果最后一个元素需要删除的时候不会出现空指针的问题即可。
Java代码实现:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode node = head;
while(node!=null && node.next!=null)
{
if(node.val == node.next.val)
{
node.next = node.next.next;
}
else
{
node = node.next;
}
}
return head;
}
}