链表
关注
分享
扫一扫
hmyqwe
这个作者很懒，什么都没留下…
展开
-
leetcode-19-删除链表的倒数第 N 个结点
/** * 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; } * ..原创 2021-04-08 17:58:38 · 69 阅读 · 0 评论 -
leetcode-876-链表的中间结点
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode middleNode(ListNode head) { ListNode fast; ListNod.原创 2021-04-08 11:16:40 · 56 阅读 · 0 评论 -
leetcode-142-环形链表 II
/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ public class Solution { public ListNode detectCycle(ListNode he..原创 2021-04-08 11:06:44 · 65 阅读 · 0 评论 -
leetcode-141-环形链表
/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ public class Solution { public boolean hasCycle(ListNode head) ..原创 2021-04-08 10:38:01 · 61 阅读 · 0 评论 -
leecode-234-回文链表
/** * 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; } * }.原创 2021-01-21 17:31:52 · 95 阅读 · 0 评论 -
leecode-25-K个一组翻转链表
/** * 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; } * }.原创 2021-01-14 18:38:54 · 93 阅读 · 0 评论 -
leecode-92-反转链表 II
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { // 后驱节点 ListNode successor = null; public ListNode reverseBetween(ListNode.原创 2021-01-07 17:43:00 · 149 阅读 · 0 评论