牛客551801357号

分类

/ 注册

全部文章（共28篇）

题解 | #设计LRU缓存结构#

import java.util.*; public class Solution { class node { int key; int value; public node(int key, int value) { ...

2023-05-26

0 158

题解 | #寻找第K大#

import java.util.*; public class Solution { public int findKth(int[] a, int n, int K) { // write code here quickSort(a,0,n-1,K); ...

2023-05-25

0 148

题解 | #最小的K个数#

import java.util.*; public class Solution { public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) { PriorityQueue...

2023-05-25

0 128

题解 | #滑动窗口的最大值#

import java.util.*; public class Solution { public ArrayList<Integer> maxInWindows(int [] num, int size) { ArrayList<Integer> ...

2023-05-25

0 98

题解 | #输出二叉树的右视图#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * 求二叉树的右视图 * @param xianxu int整型一维数组先序遍历 ...

2023-05-25

0 126

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

public class Solution { public boolean IsBalanced_Solution(TreeNode root) { int ret = isbalanced(root) ; if (ret < 0) { ...

2023-05-23

0 104

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

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

2023-05-23

0 113

题解 | #判断是不是二叉搜索树#

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

2023-05-23

0 124

题解 | #二叉树的镜像#

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

2023-05-22

0 90

题解 | #对称的二叉树#

/* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = va...

2023-05-22

0 146