Leetcode duplicates Remove from Sorted List

Given a sorted linked list, delete all duplicates such this each element appear only once.

For example,
Given 1->1->2 , return 1->2 .
Given 1->1->2->3->3 , return 1->2->3 .

Ideas:

More concise, traversing the linked list, encountering duplicate elements will delete the node. There is a note in the writing, the Link table node compares the node with the current node rather than the current node and the back node, there will be a more convenient writing process.

Solution:

1 /*2 Public class ListNode3     {4 int val;5 ListNode Next;6 7 listnode (int x)8         {9 val = x;Ten         } One     } A */ -  -  Public classSolution the { -      PublicListNode deleteduplicates (listnode head) -     { -         if(Head = =NULL|| Head.next = =NULL) +             returnhead; -  +ListNode temp =head; A  at          while(Temp.next! =NULL) -         { -             if(Temp.next.val = =temp.val) -Temp.next =Temp.next.next; -             Else -temp =Temp.next; in         } -  to         returnhead; +     } -}

Leetcode duplicates Remove from Sorted List