[leetcode] 1417. Reformat The String

Description

Given alphanumeric string s. (Alphanumeric string is a string consisting of lowercase English letters and digits).

You have to find a permutation of the string where no letter is followed by another letter and no digit is followed by another digit. That is, no two adjacent characters have the same type.

Return the reformatted string or return an empty string if it is impossible to reformat the string.

Example 1:

Input: s = "a0b1c2"
Output: "0a1b2c"
Explanation: No two adjacent characters have the same type in "0a1b2c". "a0b1c2", "0a1b2c", "0c2a1b" are also valid permutations.

Example 2:

Input: s = "leetcode"
Output: ""
Explanation: "leetcode" has only characters so we cannot separate them by digits.

Example 3:

Input: s = "1229857369"
Output: ""
Explanation: "1229857369" has only digits so we cannot separate them by characters.

Example 4:

Input: s = "covid2019"
Output: "c2o0v1i9d"

Example 5:

Input: s = "ab123"
Output: "1a2b3"

Constraints:

• 1 <= s.length <= 500
• s consists of only lowercase English letters and/or digits.

分析

题目的意思是：给定一个字符串，判断该字符串能够构成字母不能相邻且数字不能相邻的情况。我的思路很直接，统计字母和数字的个数，如果个数相差大于1，则返回空串；否则就可以进行遍历拼接构成一个合题意的字符串。

我看了一下别人的实现，跟我的思路基本差不多，关键是简单，哈哈

代码

class Solution:
    def reformat(self, s: str) -> str:
        s1=''
        s2=''
        for ch in s:
            if(ch>='0' and ch<='9'):
                s1+=ch
            else:
                s2+=ch
        if(abs(len(s1)-len(s2))<=1):
            if(len(s1)<len(s2)):
                s1,s2=s2,s1
            res=''
            for i in range(len(s2)):
                res+=s1[i]+s2[i]
            if(len(s1)!=len(s2)):
                res+=s1[-1]
            return res
        return ""

参考文献

[LeetCode][Python] Clean solutions with explanation. O(N) Time and Space.