Algorithms—83.Remove Duplicates from Sorted List
来源:互联网 发布:js设置input的value 编辑:程序博客网 时间:2024/06/07 13:38
思路:判断一个节点和节点的next是否为空,不为空的话比较两个的值,如果相同,改节点的next.next覆盖next,然后递归处理。
/** * 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;} if (head.val==head.next.val) {head.next=head.next.next;head=deleteDuplicates(head);}else {head.next=deleteDuplicates(head.next);} return head; }}
耗时:280ms;最快!反复测了几次从280到320都有。不太稳定。不过肯定是上游了。
0 0
- Algorithms—83.Remove Duplicates from Sorted List
- Algorithms—82.Remove Duplicates from Sorted List II
- LeetCode Algorithms #83 <Remove Duplicates from Sorted List>
- [LeetCode]83.Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List
- [Leetcode] 83. Remove Duplicates from Sorted List
- LeetCode --- 83. Remove Duplicates from Sorted List
- [leetcode] 83.Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List
- LeetCode 83. Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List
- 【leetcode】83. Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List LeetCode
- 83. Remove Duplicates from Sorted List
- leetcode 83. Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List
- 83. Remove Duplicates from Sorted List
- github的使用
- UIScrollView 与 Use Auto Layout
- 进程与线程的一个简单解释
- 牛客网做题总结:剑指offer中题目,java版三
- MySQL group_concat() 长度限制
- Algorithms—83.Remove Duplicates from Sorted List
- Android使用HTML和JavaScript制作页面
- 9.2链表(七)——检查链表是否为回文
- js 中的算术运算,pow ,sqrt
- xpath解析含有命名空间别名的xml文件的示例代码
- hdu 1969 pie
- C# 获取URL参数 NameValueCollection
- 支付宝
- ORACLE 实用语句大集合