techferryman
techferryman
全部文章
分类
归档
标签
去牛客网
登录
/
注册
techferryman的博客
全部文章
(共89篇)
题解 | #二叉搜索树与双向链表#
/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = v...
2023-06-04
0
219
题解 | #复杂链表的复制#
/* public class RandomListNode { int label; RandomListNode next = null; RandomListNode random = null; RandomListNode(int label) { ...
2023-06-03
0
251
题解 | #二叉树中和为某一值的路径(一)#
import java.util.ArrayList; import java.util.LinkedList; import java.util.stream.Collectors; /* * public class TreeNode { * int val = 0; * Tre...
2023-06-03
0
231
题解 | #二叉树中和为某一值的路径(二)#
import java.util.ArrayList; import java.util.LinkedList; import java.util.stream.Collectors; /** public class TreeNode { int val = 0; TreeNode...
2023-06-03
0
204
题解 | #设计LRU缓存结构#
import java.util.*; public class Solution { class Node { int key, val; Node prex, next; Node() {}; Node(int key, ...
2023-06-03
0
185
题解 | #二叉搜索树的后序遍历序列#
public class Solution { public boolean VerifySquenceOfBST(int [] sequence) { if (sequence == null || sequence.length == 0) return false; ...
2023-06-02
0
284
题解 | #从上往下打印二叉树#
import java.util.ArrayList; import java.util.LinkedList; import java.util.Queue; /** public class TreeNode { int val = 0; TreeNode left = nul...
2023-06-02
0
234
题解 | #栈的压入、弹出序列#
import java.util.ArrayList; import java.util.Stack; public class Solution { public boolean IsPopOrder(int [] pushA, int [] popA) { if (pus...
2023-06-02
0
241
题解 | #包含min函数的栈#
import java.util.Stack; public class Solution { private Node head; /** initialize your data structure here. */ public Solution() { ...
2023-06-02
0
219
题解 | #二叉树的镜像#
import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...
2023-06-02
0
208
首页
上一页
1
2
3
4
5
6
7
8
9
下一页
末页