剑指Offer Java实现
二手书杀手
qwerdf
展开
-
二叉树中和为某一值的路径34
package swordOffre.gaopengyu;import java.util.Stack;class TreeNode { int val; TreeNode left; TreeNode right; public TreeNode(int val, TreeNode left, TreeNode right) { thi...原创 2018-07-23 20:47:13 · 99 阅读 · 0 评论 -
旋转数组中的最小数字11
package swordOffre.gaopengyu;public class MinInRotateArray11 { public static void main(String[] args) {// int[] arr = new int[]{3, 4, 5, 1, 2};// int[] arr = new int[]{1,2,3,4,5...原创 2018-07-31 16:41:51 · 89 阅读 · 0 评论 -
用两个队列实现栈9.1
package swordOffre.gaopengyu;import java.util.LinkedList;import java.util.Queue;class stackEmptyException extends Exception { String str; stackEmptyException(String str) { this...原创 2018-07-30 17:02:38 · 107 阅读 · 0 评论 -
用两个栈实现队列9
package swordOffre.gaopengyu;import java.lang.reflect.Method;import java.util.Stack;class QueueWith2Stack<T> { Stack<T> stack1 = new Stack(); Stack<T> stack2 = new Stac...原创 2018-07-30 16:10:49 · 119 阅读 · 0 评论 -
二叉树的下一份节点8
package swordOffre.gaopengyu;class TreeNodeWithParent { String val; TreeNodeWithParent left; TreeNodeWithParent right; TreeNodeWithParent parent; TreeNodeWithParent(String val,...原创 2018-07-29 09:34:38 · 81 阅读 · 0 评论 -
重建二叉树7
package swordOffre.gaopengyu;public class BuildBST7 { static int[] preOrder = new int[]{1, 2, 4, 7, 3, 5, 6, 8}; static int[] inOrder = new int[]{4, 7, 2, 1, 5, 3, 8, 6}; public static...原创 2018-07-29 08:38:35 · 75 阅读 · 0 评论 -
从尾到头打印链表6
package swordOffre.gaopengyu;class LinkedListNode { int val; LinkedListNode next; public LinkedListNode(int val, LinkedListNode next) { this.val = val; this.next = next...原创 2018-07-24 15:00:22 · 65 阅读 · 0 评论 -
替换空格5
package swordOffre.gaopengyu;public class StringReplace5 { public static void main(String[] args) { String s = "we are happy."; String result = getReplaceString(s); Syst...原创 2018-07-24 14:47:24 · 93 阅读 · 0 评论 -
二维数组中的查找4
package swordOffre.gaopengyu;public class FindIn2DimensionArray4 { public static void main(String[] args) { int[][] arr = new int[][]{{1, 2, 8, 9}, {2, 4, 9, 12}, {4, 7, 10, 13}, {6, 8,...原创 2018-07-24 11:15:43 · 97 阅读 · 0 评论 -
数组中重复的数字3
package swordOffre.gaopengyu;public class DumplicatNum3 { public static void main(String[] args) { int[] arr = new int[]{1, 2, 11, 5, 7, 8, 9, 4, 3, 10, 6, 0}; int result = getD...原创 2018-07-24 10:57:05 · 98 阅读 · 0 评论 -
堆排序实现
package com.inner;public class HeapSort { /** * ������ * @param args */ public static void main(String[] args) { int[] arr = new int[]{1,2,3,4,6,5}; System.out.print...原创 2018-07-23 21:46:10 · 245 阅读 · 0 评论 -
实现singleton模式2
package swordOffre.gaopengyu;// 剑指offer2题----实现singleton模式public class Singleton2 { // 饿汉模式 贪婪加载 private Singleton2() { } private static Singleton2 singleton = new Singleton...原创 2018-07-23 20:51:39 · 138 阅读 · 0 评论 -
矩阵中的路径12
package swordOffre.gaopengyu;import java.awt.*;public class PathInMatrix12 { public static void main(String[] args) { char[] matrix = new char[]{'a', 'b', 't', 'g', 'c', 'f', 'c', 'g'...原创 2018-07-31 20:08:01 · 119 阅读 · 0 评论