public String getLCS ( String strA , String strB ) { if ( "" . equals ( strA ) ) { return "" ; } StringBuilder sb = new StringBuilder ( ) ; algC ( sb , strA . length ( ) , strB . length ( ) , strA , strB ) ; return sb . toString ( ) ; }
Gets the Longest Common Subsequence of two strings using Dynamic programming techniques and minimal memory