[LeetCode][easy]Reformat The String

最新推荐文章于 2021-05-02 23:15:27 发布

原创最新推荐文章于 2021-05-02 23:15:27 发布 · 262 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种高效的字符串重组算法，该算法能在2ms内完成运行，内存使用低于大多数在线提交。算法通过比较字母和数字数量，当两者之差不超过1时，进行重组。重组时，多的字符会先被放置。

如果字母的数量和数字的数量之差为 0 或 1，则可以 reformat。注意如果之差为 1，那么多的那种字符应该先写。

/**
Runtime: 2 ms, faster than 98.95% of Java online submissions for Reformat The String.

Memory Usage: 39.5 MB, less than 100.00% of Java online submissions for Reformat The String.
8、*/
class Solution {
    public String reformat(String s) {
        if (s == null || s.length() == 0) {
            return "";
        }
        int countOfDigit = 0;
        int countOfCharacter = 0;
        char[] digits = new char[s.length()];
        char[] characters = new char[s.length()];
        char[] chars = s.toCharArray();
        for (int i=0; i<chars.length; i++) {
            char c = chars[i];
            if (c >= 'a' && c<= 'z') {
                characters[countOfCharacter] = c;
                countOfCharacter++;
                continue;
            }
            digits[countOfDigit] = c;
            countOfDigit++;
        }
        if (Math.abs(countOfCharacter - countOfDigit) > 1) {
            return "";
        }
            StringBuilder result = new StringBuilder();
            
        if (countOfDigit > countOfCharacter) {
            for (int i=0; i<Math.min(countOfDigit, countOfCharacter); i++) {
                result.append(digits[i]);
                result.append(characters[i]);
            }
            result.append(digits[countOfDigit-1]);
        } else if (countOfDigit < countOfCharacter) {
            for (int i=0; i<Math.min(countOfDigit, countOfCharacter); i++) {
                result.append(characters[i]);
                result.append(digits[i]);
            }
            result.append(characters[countOfCharacter-1]);
        } else {
            for (int i=0; i<Math.min(countOfDigit, countOfCharacter); i++) {
                result.append(characters[i]);
                result.append(digits[i]);
            }
        }
        return result.toString();
        
    }
}