最好的开发网站建设百度天眼查公司

 当前节点的值和下一个节点的值进行比对，若相同则当前节点的下一个指向下下个，以此往复

/*** Definition for singly-linked list.* public class ListNode {*     int val;*     ListNode next;*     ListNode() {}*     ListNode(int val) { this.val = val; }*     ListNode(int val, ListNode next) { this.val = val; this.next = next; }* }*/
class Solution {public ListNode deleteDuplicates(ListNode head) {for (ListNode cur = head; cur != null; cur = cur.next) {while (cur.next != null && cur.val == cur.next.val) {cur.next = cur.next.next;}}return head;}
}