摘要: Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the 阅读全文
posted @ 2016-10-26 09:06 Grandyang 阅读(16366) 评论(5) 推荐(1)
Fork me on GitHub