编程小鹏

分类

题解(72)

/ 注册

TA的专栏 5篇文章 0人订阅

算法刷题笔记Java

5篇文章 260人学习

全部文章（共114篇）

题解 | #二分查找-II#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * 如果目标值存在返回下标，否则返回 -1 * @param nums...

2024-04-12

0 18

题解 | #最长上升子序列(一)#

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in...

2024-04-09

0 27

题解 | #[NOIP2002 普及组] 过河卒#

import java.util.Arrays; import java.util.Scanner; public class Main { static int N = 21; public static void main(String[] args) { Scanner in = n...

2024-04-09

0 35

题解 | #矩阵的最小路径和#

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(...

2024-04-09

0 19

题解 | #最大子矩阵#

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(...

2024-04-09

0 25

题解 | #合并二叉树#

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

2024-04-03

0 30

题解 | #从中序与后序遍历序列构造二叉树#

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

2024-04-02

0 31

题解 | #判断是不是平衡二叉树#

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

2024-03-30

0 31

题解 | #完全二叉树结点数#

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

2024-03-30

0 39

题解 | #二叉树的镜像#

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

2024-03-28

0 35