基于DFA的KMP实现是否比标准实现更有效？

class KMP {
  private final int R;      
  private int[][] dfa;      

  private String pat;       

  public KMP(String pat) {
    this.R = 256;
    this.pat = pat;

    int M = pat.length();
    dfa = new int[R][M]; 
    dfa[pat.charAt(0)][0] = 1; 
    for (int X = 0, j = 1; j < M; j++) {
        for (int c = 0; c < R; c++) 
            dfa[c][j] = dfa[c][X];     
        dfa[pat.charAt(j)][j] = j+1;   
        X = dfa[pat.charAt(j)][X];     
    } 
  } 

  public int search(String txt) {
    int M = pat.length();
    int N = txt.length();
    int i, j;
    for (i = 0, j = 0; i < N && j < M; i++) {
        j = dfa[txt.charAt(i)][j];
    }
    if (j == M) return i - M;    
    return -1;                   
  }
}

// test KMP DFA
KMP p = new KMP("abacab");
System.out.println("KMPDfa: " + p.search("ababbadabacabcbabac"));
output: 7