2018年3月1日
EditDistance
摘要： Edit Distance Category : Dynamic Programming Description : Given two strings str1 and str2 and below operations that can performed on str1, Find minim 阅读全文
posted @ 2018-03-01 23:31 一棵球和一枝猪 阅读(339) 评论(0) 推荐(0) 编辑
Longest Increasing Subsequence
摘要： Longest Incresing Subsequence(LIS) Category : Dynamic Programming(DP) Description : The Longest Increasing Subsequence (LIS) problem is to find the le 阅读全文
posted @ 2018-03-01 11:11 一棵球和一枝猪 阅读(247) 评论(0) 推荐(0) 编辑