Domanda di colloquio di Pocket Gems
STRSTR
Risposta di colloquio
Anonimo
4 ago 2015
brute force search the character. Simple version Scan A and Scan B, compare each chars in A try to find match B. This will cost O(M*N) which is bad.
STRSTR
Anonimo
brute force search the character. Simple version Scan A and Scan B, compare each chars in A try to find match B. This will cost O(M*N) which is bad.