恒成立

分类

题解(85)

/ 注册

全部文章（共84篇）

题解 | #二叉树的镜像#

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

二叉树

2021-09-06

0 361

题解 | #求1+2+3+...+n#

public class Solution { public int Sum_Solution(int n) { // &&短路运算 boolean b = n > 1 && (n = (1+n)*n/2) > 0;...

短路运算

2021-09-06

0 289

题解 | #翻转单词序列#

import java.util.*; public class Solution { public String ReverseSentence(String str) { String[] ss = str.split(" "); ...

Java

2021-09-06

0 335

题解 | #和为S的连续正数序列#

import java.util.ArrayList; public class Solution { public ArrayList<ArrayList<Integer> > FindContinuousSequence(int sum) { Ar...

Java

2021-09-06

0 431

题解 | #数组中只出现一次的两个数字#

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

2021-09-06

0 413

题解 | #平衡二叉树#

public class Solution { public static boolean flag = true; public boolean IsBalanced_Solution(TreeNode root) { if(root == null){ ...

二叉树

2021-09-06

0 390

题解 | #二叉树的深度#

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

二叉树递归

2021-09-06

0 422

题解 | #数字在升序数组中出现的次数#

// 方法一 import java.io.*; import java.util.*; import java.util.stream.*; public class Solution { public int GetNumberOfK(int [] array , int k) { ...

二分流

2021-09-06

0 398

题解 | #把数组排成最小的数#

import java.util.*; public class Solution { public String PrintMinNumber(int [] numbers) { if(numbers == null || numbers.length == 0){ ...

排序

2021-09-06

0 375

题解 | #连续子数组的最大和#

import java.util.*; public class Solution { public String PrintMinNumber(int [] numbers) { if(numbers == null || numbers.length == 0){ ...

排序

2021-09-06

0 441