Louis201907010812408

分类

题解(1)

/ 注册

全部文章（共113篇）

题解 | #两个链表的第一个公共结点#

import java.util.*; /* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ publi...

2023-07-01

0 165

题解 | #删除链表的倒数第n个节点#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 197

题解 | #链表中倒数最后k个结点#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 182

题解 | #链表中倒数最后k个结点#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 160

题解 | #链表中环的入口结点#

import java.util.*; /* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } } */ pub...

2023-06-29

0 142

题解 | #判断链表中是否有环#

import java.util.*; /** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * ...

2023-06-29

0 160

题解 | #合并k个已排序的链表#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 234

题解 | #合并两个排序的链表#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 229

题解 | #链表中的节点每k个一组翻转#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 188

题解 | #链表内指定区间反转#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2023-06-29

0 138