---
description: https://leetcode.com/problems/reformat-the-string/
---

# 1417. Reformat The String

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"
```

重组str使得字母和数字相隔，不能满足的话返回空。将数字和字符分别抽出放到两个list里，从长的开始轮流抽。

```python
class Solution:
    def reformat(self, s: str) -> str:
        a, b = [], []
        for c in s:
            if c.isdigit():
                a.append(c)
            else:
                b.append(c)
        if len(a) < len(b):
            a, b = b, a
        if len(a) >= len(b) + 2:
            return ''
        r = ''
        for i in range(len(s)):
            if i % 2 == 0:
                r += a[i // 2]
            else:
                r += b[i // 2]
        return r
        
```
