LeetCode --- 1417. Reformat The String 解题报告

最新推荐文章于 2024-09-22 04:59:47 发布

杨鑫newlfe

最新推荐文章于 2024-09-22 04:59:47 发布

阅读量216

点赞数

分类专栏： Python 算法 LeetCode 文章标签： leetcode 算法 Python 面试

本文链接：https://blog.csdn.net/u012965373/article/details/127781233

版权

算法同时被 3 个专栏收录

825 篇文章 1324 订阅 ¥9.90 ¥99.00

订阅专栏

Python

659 篇文章 1573 订阅 ¥9.90 ¥99.00

订阅专栏

LeetCode

413 篇文章 5 订阅

订阅专栏

这是一个关于LeetCode第1417题的解题报告，题目要求找到输入字符串的一个排列，使得字母不相邻且数字不相邻。返回重新格式化的字符串，若无法满足条件则返回空字符串。

摘要由CSDN通过智能技术生成

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 vali

了解本专栏