首页 > 代码库 > [Leetcode] Remove Duplicates from Sorted List
[Leetcode] Remove Duplicates from Sorted List
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
.
1 /** 2 * Definition for singly-linked list. 3 * public class ListNode { 4 * int val; 5 * ListNode next; 6 * ListNode(int x) { 7 * val = x; 8 * next = null; 9 * }10 * }11 */12 public class Solution {13 public ListNode deleteDuplicates(ListNode head) {14 if(head==null)15 return head;16 ListNode cur=head;17 ListNode next=cur.next;18 while(next!=null){19 if(next.val==cur.val){20 cur.next=next.next;21 next=next.next;22 }23 else{24 next=next.next;25 cur=cur.next;26 }27 }28 return head;29 }30 }
[Leetcode] Remove Duplicates from Sorted List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。