摘要: 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 @ 2017-09-21 05:19 apanda009 阅读(114) 评论(0) 推荐(0)