黑眼X

分类

/ 注册

全部文章（共15篇）

题解 | 不同的二叉搜索树

import java.util.*; public class Solution { /** *使用卡特兰数（Catalan）公式 * @param n int整型 * @return int整型 */ public in...

2025-10-10

0 9

题解 | 二叉树的最大深度

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

2025-09-30

0 17

题解 | 将升序数组转化为平衡二叉搜索树

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

2025-09-30

0 12

题解 | 填充每个节点指向最右节点的next指针

import java.util.*; /** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, righ...

2025-09-29

0 23

题解 | 买卖股票的最好时机 ii

import java.util.*; public class Solution { /** * * @param prices int整型一维数组 * @return int整型 */ public int maxProfit (int...

2025-09-28

0 18

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

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

2025-09-28

0 18

题解 | 求二叉树的前序遍历

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

2025-09-28

0 16

题解 | 访问单个节点的删除

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

2025-09-27

0 15

题解 | 另类加法

import java.util.*; public class UnusualAdd { public int addAB(int A, int B) { int C = 0; while (B != 0) { C = A ^ B...

2025-09-27

0 15

题解 | 无判断max

import java.util.*; public class Max { public int getMax(int a, int b) { return b& (a-b)>>31 | a& ~(a-b) >> 31; ...

2025-09-27

0 17