摘要:
package com.sun.test.student; public class KMP算法 { public static int[] getNext(String ps) { char[] p = ps.toCharArray(); int[] next = new int[p.length 阅读全文
摘要:
public class Node { int value; Node left; Node right; public Node(int value){ this.value=value; } /** * 返回当前节点的高度 * @return */ public int hight(){ ret 阅读全文