关于contribution# Immigration - 落地生根
p*o
1 楼
LeetCode上的题目,我怎么想都是O(kn),k是T里的unique charater的数目。请问大侠
如何做到O(n)。
附题目:
Given a string S and a string T, find the minimum window in S which will
contain all the characters in T in complexity O(n).
For example,
S = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC".
如何做到O(n)。
附题目:
Given a string S and a string T, find the minimum window in S which will
contain all the characters in T in complexity O(n).
For example,
S = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC".