使用Java在二进制文件中搜索字节序列

Bas*_*sam 35 java search byte binaryfiles

我有一个字节序列,我必须使用Java在一组二进制文件中搜索.

示例:我正在DEADBEEF二进制文件中搜索字节序列(十六进制).我将如何在Java中执行此操作?是否有内置方法,如String.contains()二进制文件?

jan*_*nko 53

不,没有内置方法可以做到这一点.但是,直接从HERE复制(两个修复应用于原始代码):

/**
 * Knuth-Morris-Pratt Algorithm for Pattern Matching
 */
class KMPMatch {
    /**
     * Finds the first occurrence of the pattern in the text.
     */
    public static int indexOf(byte[] data, byte[] pattern) {
        if (data.length == 0) return -1;

        int[] failure = computeFailure(pattern);    
        int j = 0;

        for (int i = 0; i < data.length; i++) {
            while (j > 0 && pattern[j] != data[i]) {
                j = failure[j - 1];
            }
            if (pattern[j] == data[i]) { j++; }
            if (j == pattern.length) {
                return i - pattern.length + 1;
            }
        }
        return -1;
    }

    /**
     * Computes the failure function using a boot-strapping process,
     * where the pattern is matched against itself.
     */
    private static int[] computeFailure(byte[] pattern) {
        int[] failure = new int[pattern.length];

        int j = 0;
        for (int i = 1; i < pattern.length; i++) {
            while (j > 0 && pattern[j] != pattern[i]) {
                j = failure[j - 1];
            }
            if (pattern[j] == pattern[i]) {
                j++;
            }
            failure[i] = j;
        }

        return failure;
    }
}
Run Code Online (Sandbox Code Playgroud)

  • 我喜欢StackOverflow.谢谢! (3认同)
  • 优化很少:如果data.length为零,则不需要计算模式的失败函数==>您可以将data.length zero检查移动到函数的第一行. (2认同)