摘要：
"题目链接" 题意 给定N个DNA字符串，找到最短的字符串使N个字符串都是它的子序列(不连续) 解题思路 又是典型的IDA 迭代加深搜索思路，用一个数组保存每次搜索到对于N个字符串的下标，当每个下标都到了字符串的结尾的时候即说明解出了答案。 为防止超时，当此时深度+至少还要加深的深度 限制值时就返回 阅读全文
摘要：
"题目链接" 题意 f[0] = 1,f[1] = 2 f[k] = f[i] + f[j] (0 include include include include include include include include include include using namespace std; 阅读全文