Target2018's blog

By Target2018, history, 5 years ago, In English

I was trying to solve this problem, but can't figure out the recurrence relation.Then I read this article but didn't understand this part, and I can't figure out the image of tiling, can anyone tell me about the recurrence of g(n) in the second part.And how can I solve this type of problems also?

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By Target2018, history, 5 years ago, In English

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

Read more »

 
 
 
 
  • Vote: I like it
  • +14
  • Vote: I do not like it