Sentence Similarity II


Hi, I agree with the time complexity of DFS method is O(N + P), what do you think? @awice

@IWantToPass In each DFS, we visit at most P+1 nodes. The "V" is not N necessarily.
@wqmbisheng There are N DFS's, each DFS is O(P).
