最简单的倒立方法# Joke - 肚皮舞运动
n*r
1 楼
原帖在这里:
http://www.mitbbs.com/article_t/JobHunting/31996705.html
题目是:
“2. Given two strings that one string contains the other string, while
the other string could be split into any set of substrings. Please find
the minimum split time. Example: "apple pie is deicious" contains
"applepie"'s substring set "apple" and "pie", so the minimum split time
is 1”
看回帖有人说是DP + recursive, 百思不得其解
请教一下大家~
http://www.mitbbs.com/article_t/JobHunting/31996705.html
题目是:
“2. Given two strings that one string contains the other string, while
the other string could be split into any set of substrings. Please find
the minimum split time. Example: "apple pie is deicious" contains
"applepie"'s substring set "apple" and "pie", so the minimum split time
is 1”
看回帖有人说是DP + recursive, 百思不得其解
请教一下大家~