2019年2月12日
[Lintcode] 170. Rotate List/[Leetcode]61. Rotate List
摘要： "170. Rotate List" / "61. Rotate List" 本题难度: Medium Topic: Linked List Description Given a linked list, remove the nth node from the end of list and r 阅读全文
posted @ 2019-02-12 16:09 siriusli 阅读(152) 评论(0) 推荐(0) 编辑
[Lintcode]35. Reverse Linked List/[Leetcode]206. Reverse Linked List
摘要： "35. Reverse Linked List" / "206. Reverse Linked List" 本题难度: Easy Topic: Linked List Description Reverse a linked list. Example Example1: For linked l 阅读全文
posted @ 2019-02-12 15:00 siriusli 阅读(85) 评论(0) 推荐(0) 编辑
[Lintcode]96. Partition List/[Leetcode]86. Partition List
摘要： "96. Partition List" / "86. Partition List" 本题难度: Easy/Medium Topic: Linked List Description Given a linked list and a value x, partition it such that 阅读全文
posted @ 2019-02-12 14:39 siriusli 阅读(78) 评论(0) 推荐(0) 编辑
[Lintcode]112. Remove Duplicates from Sorted List/[Lintcode]83. Remove Duplicates from Sorted List
摘要： "112. Remove Duplicates from Sorted List" / "83. Remove Duplicates from Sorted List" 本题难度: Easy/Medium Topic: Linked List Description Given a sorted l 阅读全文
posted @ 2019-02-12 14:09 siriusli 阅读(77) 评论(0) 推荐(0) 编辑
[Lintcode]165. Merge Two Sorted Lists/[Leetcode]21. Merge Two Sorted Lists
摘要： "165. Merge Two Sorted Lists" / "21. Merge Two Sorted Lists" 本题难度: Easy Topic: Linked List Description Merge two sorted (ascending) linked lists and r 阅读全文
posted @ 2019-02-12 13:47 siriusli 阅读(107) 评论(0) 推荐(0) 编辑
[Python3] 面向对象编程
摘要： 主要参考资料： "RUNOOB.COM Python3 面向对象" 之前没有仔细看过python的面向对象编程，因为Linked List中用到了定义新的类，所以简单看了一下教程。 因为之前学过了C/C++ 所以只是简单的记录了一下之前不知道/忘了的点。 笔记和代码主要摘录自RUNOOB.COM的 阅读全文
posted @ 2019-02-12 03:23 siriusli 阅读(167) 评论(0) 推荐(0) 编辑
[Lintcode]174. Remove Nth Node From End of List/[Leetcode]
摘要： "174. Remove Nth Node From End of List" / "19. Remove Nth Node From End of List" 本题难度: Easy/Medium Topic: Linked List Description Given a linked list, 阅读全文
posted @ 2019-02-12 02:21 siriusli 阅读(85) 评论(0) 推荐(0) 编辑