Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Description

This problem was asked by Flexport.

Given a string s, rearrange the characters so that any two adjacent characters are not the same. If this is not possible, return null.

For example, if s = yyz then return yzy. If s = yyy then return null.

Kotlin Solution

TBD


回到 daily coding problem 列表