longest common subsequence

Posted by davit-datuashvili on Stack Overflow See other posts from Stack Overflow or by davit-datuashvili
Published on 2010-05-28T13:53:09Z Indexed on 2010/05/28 14:01 UTC
Read the original article Hit count: 229

Filed under:
|
|

i have following code

public class LCS1 {

  public static String lcs(String a,String b) {
      String x;
      String y;


      int alen=a.length();
      int blen=b.length();
      if (alen==0 || blen==0) {
        return "";
      }
      else if (a.charAt(alen-1)==b.charAt(blen-1)) {
        return lcs(a.substring(0,alen-1),b.substring(0,blen-1));
      }
      else {
        x=lcs(a,b.substring(0,blen-1));
        y=lcs(a.substring(0,alen-1),b);
      }
      return (x.length()>y.length()) ? x : y;
  }


  public static void main(String[]args){

    String a="computer";
    String b="houseboat";
    System.out.println(lcs(a,b));

  }
}

it should return "out" but returns nothing what is problem?

© Stack Overflow or respective owner

Related posts about java

Related posts about algorithm