leetcode : Remove Duplicates from Sorted List[算法基本功]
Posted notesbuddy
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode : Remove Duplicates from Sorted List[算法基本功]相关的知识,希望对你有一定的参考价值。
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
.
tag: dummy node 算法基本功
/** * 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 dummy = new ListNode(0); dummy.next = head; //head = dummy; while(head!= null && head.next!= null) { ListNode tmp = head; while(head != null && head.next!= null) { if(head.val == head.next.val) { head = head.next; } else { break; } } tmp.next = head.next; head = head.next; } return dummy.next; } }
以上是关于leetcode : Remove Duplicates from Sorted List[算法基本功]的主要内容,如果未能解决你的问题,请参考以下文章