希望下面的文章对大家有所帮助。
Given1->1->2, return1->2.
Given1->1->2->3->3, return1->2->3.
- /** * 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 list = head;
- while (list.next != null) {
- if (list.val == list.next.val) {
- list.next = list.next.next;
- } else {
- list = list.next;
- }
- }
- return head;
- }
- }
就爱阅读 www.92to.com 网友整理上传, 为您提供最全的知识大全, 期待您的分享,转载请注明出处。
来源: