随笔分类 -  greedy dfs

Rearrange String k Distance Apart
摘要：Analysis: Solution 1: The greedy algorithm is that in each step, select the char with highest remaining count if possible (if it is not in the waiting 阅读全文
posted @ 2017-11-07 21:37 apanda009 阅读(198) 评论(0) 推荐(0)