摘要：
1 理论http://www.52nlp.cn/hmm-learn-best-practices-and-cui-johnny-blog2 代码HMM.zip 阅读全文
摘要：
View Code /** * TODO 折半查找，二叉树与后序遍历，堆排序 * */import java.util.Arrays;import java.util.Random;public class search { public static int discount(Integer[] data, int t) { int low = 0; int high = data.length - 1; while (low <= high) { int mid = (low + high) / 2; ... 阅读全文