package strings; import java.math.BigInteger; import java.util.Random; public class Hashing { static final long multiplier = 131; static final Random rnd = new Random(); static final int mod1 = BigInteger.valueOf((int) (1e9 + rnd.nextInt((int) 1e9))).nextProbablePrime().intValue(); static final int mod2 = BigInteger.valueOf((int) (1e9 + rnd.nextInt((int) 1e9))).nextProbablePrime().intValue(); int[] hash1, hash2, p1, p2; public Hashing(CharSequence s) { int n = s.length(); hash1 = new int[n + 1]; hash2 = new int[n + 1]; p1 = new int[n + 1]; p2 = new int[n + 1]; p1[0] = 1; p2[0] = 1; for (int i = 0; i < n; i++) { hash1[i + 1] = (int) ((hash1[i] * multiplier + s.charAt(i)) % mod1); hash2[i + 1] = (int) ((hash2[i] * multiplier + s.charAt(i)) % mod2); p1[i + 1] = (int) (p1[i] * multiplier % mod1); p2[i + 1] = (int) (p2[i] * multiplier % mod2); } } public long getHash(int i, int len) { long h1 = (hash1[i + len] + (long) hash1[i] * (mod1 - p1[len])) % mod1; long h2 = (hash2[i + len] + (long) hash2[i] * (mod2 - p2[len])) % mod2; return (h1 << 32) + h2; } // random test public static void main(String[] args) { Random rnd = new Random(1); for (int step = 0; step < 1000; step++) { int n1 = rnd.nextInt(50); String s1 = getRandomString(n1, rnd); int n2 = rnd.nextInt(50); String s2 = getRandomString(n2, rnd); Hashing h1 = new Hashing(s1); Hashing h2 = new Hashing(s2); for (int k = 0; k < 1000; k++) { int i1 = rnd.nextInt(n1 + 1); int j1 = rnd.nextInt(n1 - i1 + 1) + i1; int i2 = rnd.nextInt(n2 + 1); int j2 = rnd.nextInt(n2 - i2 + 1) + i2; if (s1.substring(i1, j1).equals(s2.substring(i2, j2)) != (h1.getHash(i1, j1 - i1) == h2.getHash(i2, j2 - i2))) throw new RuntimeException(); } } } static String getRandomString(int n, Random rnd) { char[] s = new char[n]; for (int i = 0; i < n; i++) { s[i] = (char) ('a' + rnd.nextInt(3)); } return new String(s); } }