守望初心

靡有不初，鲜克有终。。。

导航

2014年11月9日

[006] largest_common_substring

摘要： [Description] Given two different strings, find the largest successive common substring.e.g. str1[]="qwertyuiopasdfgh"; str2[]="jhdfgqwertyudfxcv";　... 阅读全文

posted @ 2014-11-09 11:47 Reynold Liu 阅读(224) 评论(0) 推荐(0)

[005] unique_sub_string

摘要： [Description] Given a string, find the largest unique substring.e.g. str[] = "asdfghjkkjhgf"; sub[] = "asd";[Thought] create an auxiliary space 'r... 阅读全文

posted @ 2014-11-09 10:45 Reynold Liu 阅读(188) 评论(0) 推荐(0)