Java recursion #5

j45.java

/* 
Given a string and a non-empty substring sub, compute recursively the largest substring which starts and ends with sub and return its length. */

public int strDist(String str, String sub) {
  if (str.length() < sub.length()) return 0;
  if (str.substring(0, sub.length()).equals(sub) &&
      str.substring(str.length() - sub.length(), str.length()).equals(sub))
    return str.length();
    int p1 = strDist(str.substring(1), sub);
    int p2 = strDist(str.substring(0, str.length() - 1), sub);
  return Math.max(p1, p2);
}

http://codingbat.com/prob/p195413