lint code : O(N) string match?# JobHunting - 待字闺中
c*n
1 楼
http://www.lintcode.com/en/problem/strstr/#
if not KMP, what other approaches are possible? seems there is really not
any O(N) solutions simpler than KMP
if not KMP, what other approaches are possible? seems there is really not
any O(N) solutions simpler than KMP