水镜客

分类

题解(27)

/ 注册

全部文章（共25篇）

题解 | #数值的整数次方#

需要注意base同时做平方运算，因为右移一位是平方的 public double Power(double base, int exponent) { if(base == 0 && exponent == 0){ return 0; ...

Java

2022-03-13

0 273

题解 | #二进制中1的个数#

注意使用无符号右移 public int NumberOf1(int n) { int a = 0; while (n != 0) { if ((n & 1) == 1) { a++; } n =...

Java

2022-03-13

0 333

题解 | #二叉搜索树的后序遍历序列#

public class Solution { public boolean VerifySquenceOfBST(int [] sequence) { if(sequence.length == 0){ return false; }...

Java

2022-03-12

0 412

题解 | #栈的压入、弹出序列#

用一个栈模拟： public class Solution { public boolean IsPopOrder(int [] pushA,int [] popA) { Stack<Integer> s = new Stack(); int i =...

Java

2022-03-12

0 308

题解 | #包含min函数的栈#

使用一个辅助栈记录当前最小值 public class Solution { Stack<Integer> stack1 = new Stack(),stack2 = new Stack(); public void push(int node) { ...

Java

2022-03-12

0 314

题解 | #顺时针打印矩阵#

按圈打印 public class Solution { public ArrayList<Integer> printMatrix(int [][] matrix) { ArrayList<Integer> arraylist = new ArrayL...

Java

2022-03-12

0 396

题解 | #对称的二叉树#非递归dfs实现

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

Java

2022-03-12

0 561

题解 | #对称的二叉树#递归实现判断

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

Java

2022-03-12

0 337

题解 | #二叉树的镜像#

先序遍历的运用 /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int val) { * ...

Java

2022-03-12

0 355

题解 | #链表中倒数最后k个结点# 最终版本

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

Java

2022-03-12

0 367