旺旺汪汪大旺财

分类

题解(47)

/ 注册

全部文章（共43篇）

题解 | #最小的K个数#(大根堆、优先级对列、比较器）

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

Java

2022-04-01

0 403

题解 | #最小的K个数#

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

Java

2022-03-30

0 323

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

public class Solution { public ArrayList<Integer> maxInWindows(int [] num, int size) { if(size==0||size>num.length||num==null) re...

Java

2022-03-27

0 420

题解 | #有效括号序列#

public class Solution { /** * * @param s string字符串 * @return bool布尔型 */ public boolean isValid (String s) { // w...

Java

2022-03-27

0 319

题解 | #包含min函数的栈#

public class Solution { //要求时间复杂度为o(1)，使用辅助栈,存储每次的最小值 Stack<Integer> minStack=new Stack<>(); Stack<Integer> min=new Stac...

Java

2022-03-27

0 314

题解 | #包含min函数的栈#

public class Solution { Stack<Integer> minStack=new Stack<>(); int min=Integer.MAX_VALUE; public void push(int node) { ...

Java

2022-03-27

0 294

题解 | #用两个栈实现队列#

public class Solution { Stack<Integer> stack1 = new Stack<Integer>(); Stack<Integer> stack2 = new Stack<Integer>(); ...

Java

2022-03-27

0 278

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

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

Java

2022-03-26

0 385

题解 | #重建二叉树#

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val...

Java

2022-03-26

0 378

题解 | #序列化二叉树#

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

Java

2022-03-26

0 323