摘要:
汉诺塔—理解递归 如下图所示,从左到右有A、B、C三根柱子,其中A柱子上面有从小叠到大的n个圆盘,现要求将A柱子上的圆盘移到C柱子上去,期间只有一个原则:一次只能移到一个盘子且大盘子不能在小盘子上面,求移动的步骤 Code c++ include using namespace std; void 阅读全文
摘要:
Edit Distance Category : Dynamic Programming Description : Given two strings str1 and str2 and below operations that can performed on str1, Find minim 阅读全文
摘要:
Longest Incresing Subsequence(LIS) Category : Dynamic Programming(DP) Description : The Longest Increasing Subsequence (LIS) problem is to find the le 阅读全文