给定一个排序链表,删除所有重复的元素每个元素只留下一个。
样例
给出 1->1->2->null
,返回 1->2->null
给出 1->1->2->3->3->null
,返回 1->2->3->null
解题思路:
非常简单,用一个指针currentNode与他的下一个元素两者的值进行比较,若相同则删除后一个元素,若不同则继续遍历。
/**
* Definition of singly-linked-list:
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param head: head is the head of the linked list
* @return: head of linked list
*/
ListNode * deleteDuplicates(ListNode * head)
{
// write your code here
if(head == NULL) return NULL;
ListNode * currentNode = head;
while(currentNode->next != NULL)
{
if(currentNode->val != currentNode->next->val)
currentNode = currentNode->next;
else
currentNode->next = currentNode->next->next;
}
return head;
}
};
JAVA代码:
/**
* Definition for ListNode
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
/**
* @param head: head is the head of the linked list
* @return: head of linked list
*/
public ListNode deleteDuplicates(ListNode head) {
// write your code here
if(head == null)
return null;
ListNode node = head;
while(node.next != null){
if(node.val == node.next.val)
node.next = node.next.next;
else
node = node.next;
}
return head;
}
}