Reorganize String

Reorganize String

Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.
If possible, output any possible result. If not possible, return the empty string.

Example

Input: S = “aab”
Output: “aba”

Solution

@collections处理字符串中各个字符出现的频率
class Solution:
    def reorganizeString(self, S: str) -> str:
        counter = collections.Counter(S)
        ret = '#'
        while counter:
            flag = True
            for item, times in counter.most_common():
                if ret[-1]!= item:
                    ret+= item
                    counter[item]-= 1
                    if not counter[item]:
                        del counter[item]
                    flag = False
                    break
            if flag:
                break
        return ret[1::] if len(ret)==len(S)+1 else ''
发布了250 篇原创文章 · 获赞 9 · 访问量 2万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览