Reorganize String

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 = Truefor item, times st_common():if ret[-1]!= item:ret+= itemcounter[item]-= 1if not counter[item]:del counter[item]flag = Falsebreakif flag:breakreturn ret[1::] if len(ret)==len(S)+1 else ''