https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/
难度简单634收藏分享切换为英文接收动态反馈
存在一个按升序排列的链表,给你这个链表的头节点?head ?,请你删除所有重复的元素,使每个元素?只出现一次?。
返回同样按升序排列的结果链表。
示例 1:
输入:head = [1,1,2]
输出:[1,2]
示例 2:
输入:head = [1,1,2,3,3]
输出:[1,2,3]
提示:
- 链表中节点数目在范围?
[0, 300] ?内 -100 <= Node.val <= 100 - 题目数据保证链表已经按升序排列
通过次数304,640提交次数565,564 ?
/**
* 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) {
if(head == null) return head;
ListNode node = head;
while(head.next!=null)
{
if(head.val == head.next.val) head.next = head.next.next;
else head = head.next;
}
return node;
}
}
?
?
|