「已注销」 2014-09-16 16:33 采纳率: 0%
浏览 1699

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 2014-09-17 13:05
    关注

    are u from minzu university?

    评论

报告相同问题？