Alan's Automaton Workshop

Alan's Automaton Workshop

评价数不足
A boring LCS problem
   
奖励
收藏
已收藏
取消收藏
文件大小
发表于
52.461 KB
2023 年 4 月 2 日 上午 5:57
1 项改动说明 ( 查看 )

订阅以下载
A boring LCS problem

描述
Given two strings s1 and s2, find the length of their Longest Common Subsequence. The answer is guaranteed to be less than 10.

給定字串 s1、s2,請找出它們的最長共同子序列之長度。保證答案小於 10。

//Version:1.1 by InversionPeter
1 条留言
Kalle 2023 年 8 月 1 日 下午 12:40 
This was not boring! My first try was with a recursive algorithm, didn't work and was too complicated. I then found the right algorithm and made it with 1230/4290.60. Great.