2 u013675317 u013675317 于 2014.09.17 00:33 提问

java 编程 各位大神帮忙提供解题思路T^T

boolean stringIntersect(String a, String b, int len)
Given 2 strings, consider all the substrings within them of length len. Returns true if there are any such substrings which appear in both strings. Compute this in O(n) time using a HashSet. Len will be 1 or more.

1个回答

flashingyellow
flashingyellow   2014.09.17 21:05

are u from minzu university?

Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!