[Leetcode] 767. Reorganize String 解题报告

编程入门行业动态更新时间:2024-10-22 11:30:58

[Leetcode] 767. Reorganize String 解题<a href=https://www.elefans.com/category/jswz/34/1770268.html style= 报告"/>

题目：

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 1:

更多推荐

[Leetcode] 767. Reorganize String 解题报告

本文发布于:2024-02-05 09:10:59，感谢您对本站的认可！

评论列表（有 0 条评论）