Package g1401_1500.s1417_reformat_the_string

Class Solution

java.lang.Object

g1401_1500.s1417_reformat_the_string.Solution

public class Solution
extends Object

1417 - Reformat The String\. Easy You are given an 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. **Constraints:** * `1 <= s.length <= 500` * `s` consists of only lowercase English letters and/or digits.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
String	reformat(String s)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

reformat

public String reformat(String s)