techferryman

分类

/ 注册

全部文章（共89篇）

题解 | #扑克牌顺子#

import java.util.HashSet; public class Solution { public boolean IsContinuous(int [] numbers) { if(numbers==null||numbers.length<5){ ...

2023-06-09

0 210

题解 | #翻转单词序列#

public class Solution { public String ReverseSentence(String str) { if (str == null) return ""; char[] chars = str.toCharArray(); ...

2023-06-09

0 244

题解 | #左旋转字符串#

public class Solution { public String LeftRotateString(String str, int n) { if (n == 0 || str == null || str.length() == 0) { ...

2023-06-08

0 222

题解 | #和为S的两个数字#

import java.util.ArrayList; public class Solution { public ArrayList<Integer> FindNumbersWithSum(int [] array, int sum) { ArrayList&...

2023-06-08

0 264

题解 | #有序数组中出现一次的元素#

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

2023-06-08

0 311

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

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

2023-06-08

0 247

题解 | #只出现一次的数字#

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

2023-06-06

0 295

题解 | #判断是不是平衡二叉树#

public class Solution { public boolean IsBalanced_Solution(TreeNode root) { if (root != null) { int left = deep(root.left); ...

2023-06-06

0 276

题解 | #二叉树的深度#

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

2023-06-06

0 247

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

public class Solution { public int GetNumberOfK(int [] array, int k) { // 数组为空或者数组元素个数为0，直接返回 if (array == null || array.length ==...

2023-06-06

1 249