我是一颗大白菜__

分类

题解(13)

/ 注册

全部文章（共43篇）

题解 | #kmp算法#

import java.util.*; /* sb题真难 kmp算法的核心思想在于指向T串的指针i永远不回退，当出现不匹配时，指向S串的指针j进行连续回退；所以需要对S串求next数组，怎么求的没看明白. */ public class Solution { /** * 代码中...

2024-06-20

0 151

题解 | #二叉树的最大深度#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-03-16

0 186

题解 | #判断是不是完全二叉树#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-03-10

0 222

题解 | #二叉树的镜像#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-03-10

0 198

题解 | #合并二叉树#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-03-10

0 197

题解 | #01背包#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * 计算01背包问题的结果 * @param V int整型背包的体...

2024-03-07

0 241

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

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

2024-03-02

0 206

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

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

2024-03-02

0 219

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

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

2024-03-02

0 210

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

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

2024-03-02

0 213