硌手的小虫子

分类

/ 注册

全部文章（共92篇）

题解 | #链表的奇偶重排#

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

2024-09-17

0 81

题解 | #判断一个链表是否为回文结构#

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

2024-09-17

0 74

题解 | #单链表的排序#

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

2024-09-17

0 54

题解 | #链表相加(二)#

import java.util.*; public class Solution { public ListNode addInList (ListNode head1, ListNode head2) { Stack<ListNode> stack1 = n...

2024-09-17

0 60

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

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

2024-09-17

0 55

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

import java.util.*; public class Solution { public ListNode FindKthToTail (ListNode pHead, int k) { int n=0; ListNode tmp=pHead; ...

2024-09-17

0 64

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

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

2024-09-17

0 60

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

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

2024-09-17

0 74

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

import java.util.*; public class Solution { public ListNode mergeKLists (ArrayList<ListNode> lists) { PriorityQueue<ListNode>...

2024-09-16

0 57

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

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

2024-09-16

0 44