摘要：
Given a string, find the length of the longest substring T that contains at most k distinct characters. For example, Given s = “eceba” and k = 2, T is 阅读全文
posted @ 2017-04-26 13:02
amazingzoe
阅读(149)
评论(0)
推荐(0)
浙公网安备 33010602011771号