LongestCommonSubsequence: no need to initialize int[] with zero, it has a zero already anyway. There's a tiny speed increase by removing the loops, but micro-benchmarking is another topic. Anyway, it certainly does not hurt to remove it.

Author: fabiankessler

src/main/java/info/debatty/java/stringsimilarity/LongestCommonSubsequence.java

@@ -94,14 +94,6 @@ public final int length(final String s1, final String s2) {
 
         int[][] c = new int[m + 1][n + 1];
 
-        for (int i = 0; i <= m; i++) {
-            c[i][0] = 0;
-        }
-
-        for (int j = 0; j <= n; j++) {
-            c[0][j] = 0;
-        }
-
         for (int i = 1; i <= m; i++) {
             for (int j = 1; j <= n; j++) {
                 if (x[i - 1] == y[j - 1]) {