Leetcode Remove Duplicates from Sorted List
来源:互联网 发布:iphone蜂窝数据用户名 编辑:程序博客网 时间:2024/06/06 08:42
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
.
Difficulty: Easy
/** * 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) return null; ListNode curr = head; while(curr.next != null){ if(curr.val == curr.next.val){ curr.next = curr.next.next; } else{ curr = curr.next; } } return head; }}
0 0
- Remove Duplicates from Sorted List :from LeetCode
- Leetcode - List - Remove Duplicates from Sorted List
- [leetcode][list] Remove Duplicates from Sorted List
- [leetcode][list] Remove Duplicates from Sorted List
- LeetCode: Remove Duplicates from Sorted List
- LeetCode: Remove Duplicates from Sorted List II
- [Leetcode] Remove Duplicates from Sorted List
- [Leetcode] Remove Duplicates from Sorted List II
- LeetCode: Remove Duplicates from Sorted List
- LeetCode: Remove Duplicates from Sorted List II
- [Leetcode] Remove Duplicates from Sorted List II
- leetcode 37: Remove Duplicates from Sorted List
- [leetcode] Remove Duplicates from Sorted List II
- [LeetCode] Remove Duplicates from Sorted List II
- [LeetCode] Remove Duplicates from Sorted List
- [leetcode] Remove Duplicates from Sorted List
- [leetcode] Remove Duplicates from Sorted List II
- [LeetCode]Remove Duplicates from Sorted List
- 算法日记(Java实现)第20160719(5)期——POJ1008
- 在安装Ubuntu的MacBook上更改Apple 键盘模式
- 最小边割集
- Leetcode Power of Two/Three/Four
- Leetcode Path Sum
- Leetcode Remove Duplicates from Sorted List
- Reorder List
- 重建控制文件后,各文件(datafile、control file、redo log)中scn的关系
- Leetcode Odd Even Linked List
- Leetcode Binary Tree Maximum Path Sum
- IOS控件总是看不见。
- Leetcode Maximal Rectangle
- Leetcode 3Sum Closest
- Leetcode Populating Next Right Pointers in Each Node