![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
44_算法
信行合一
彻底拆分一切可控!
展开
-
递归举例
计算n的阶乘public class Factorial{public int f(int n){if(n == 1){return 1;}else{int k = f(n-1);return n*k;}}public static void main(String args[]){Factorial fact = new Factorial()原创 2011-12-04 16:34:49 · 672 阅读 · 0 评论 -
java判断循环数组是否连续并获取不连续的项以及重复项
package com.hdx.test;import java.util.ArrayList;import java.util.List;public class Lianxu { public static void main(String[] args) { int[] arr = new int[] { 1, 2, 5, 6, 8, 8,8,8,8,9, 9, 3, 9,...原创 2012-11-14 16:09:47 · 7040 阅读 · 0 评论 -
MD5算法
package com.dada.lucene;import java.lang.reflect.Array;public class MD5 { static final int S11 = 7; static final int S12 = 12; static final int S13 = 17; static final int S14 = 22; static转载 2012-12-13 21:20:46 · 683 阅读 · 0 评论 -
java 实现二叉树
1.二叉树类:package com.j2se.test;public class BinaryTree { int data; //根节点数据 BinaryTree left; BinaryTree right; /** * 二叉树构造方法 * @param data */ public BinaryTree(int data) { this.dat转载 2014-01-05 23:51:51 · 1261 阅读 · 0 评论 -
布隆过滤器
import java.util.BitSet;public class BloomFilter { private static final int DEFAULT_SIZE = 2 << 24;//布隆过滤器的比特长度 private static final int[] seeds = {3,5,7, 11, 13, 31, 37, 61};//这里要选取质数,能很好的降低错误转载 2014-03-04 15:24:30 · 1021 阅读 · 0 评论