MD5-HY

分类

题解(35)

/ 注册

全部文章（共33篇）

题解 | #数组中的逆序对#

public class Solution { private int res = 0; private int[] temp; public int InversePairs(int [] array) { if(array.length == 0 ||...

2021-07-14

0 331

题解 | #调整数组顺序使奇数位于偶数前面#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param array int整型一维数组 *...

2021-07-14

0 383

题解 | #按之字形顺序打印二叉树#

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

2021-07-01

0 353

题解 | #把二叉树打印成多行#

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

2021-07-01

0 353

题解 | #从上往下打印二叉树#

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

2021-07-01

0 397

题解 | #对称的二叉树#

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

2021-06-30

0 438

题解 | #二叉树的镜像#

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

2021-06-30

0 451

题解 | #树的子结构#

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

2021-06-30

0 423

题解 | #二叉树的下一个结点#

/* public class TreeLinkNode { int val; TreeLinkNode left = null; TreeLinkNode right = null; TreeLinkNode next = null; TreeLinkNo...

2021-06-30

0 319

题解 | #重建二叉树 #

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

2021-06-30

0 370