Problem with LCS

Правка en2, от Target2018, 2016-09-14 19:18:54

After running LCS on two strings A and B, the 2D array DP is filled with values.Now if the 2D array is given , how can I assume string A and B ?Let the length of A and B are n and m respectively, then 1 <= n , m <= 25. It is guaranteed that A and B contain only lowercase English letters. //Sorry for my bad English

Теги lcs, dynamic programming

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Target2018 2016-09-14 19:18:54 5 Tiny change: 'nning LCS code on two st' -> 'nning LCS on two st'
en1 Английский Target2018 2016-09-14 19:16:48 337 Initial revision (published)