摘要: 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 @ 2018-09-07 11:23 康托漫步 阅读(101) 评论(0) 推荐(0) 编辑