Linked List
文章平均质量分 54
liujunlovecs
这个作者很懒,什么都没留下…
展开
-
Leetcode#2||Add Two Numbers
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode addT原创 2015-08-11 09:27:37 · 240 阅读 · 0 评论 -
Leetcode#21||Merge Two Sorted Lists
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode merg原创 2015-08-12 15:51:29 · 212 阅读 · 0 评论 -
Leetcode#19||Remove Nth Node From End of List
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode remo原创 2015-08-12 12:17:16 · 221 阅读 · 0 评论 -
Leetcode#25||Reverse Nodes in k-Group
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode reve原创 2015-08-12 17:04:55 · 274 阅读 · 0 评论 -
Leetcode#24||Swap Nodes in Pairs
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode swap原创 2015-08-12 16:15:11 · 220 阅读 · 0 评论 -
Leetcode#61||Rotate List
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode rota原创 2015-08-18 11:08:55 · 295 阅读 · 0 评论