[LeetCode][easy]Reformat The String

如果字母的数量和数字的数量之差为 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();}
}

[LeetCode][easy]Reformat The String相关推荐

Leetcode 1370. Increasing Decreasing String
Leetcode 1370. Increasing Decreasing String 题目链接: Increasing Decreasing String 难度:easy 题目大意: 按照题目要求对 ...
leetcode算法题--Decode String
原题链接:https://leetcode.com/problems/decode-string/ string decodeString(string s) {int n = s.size(), i ...
【字符串全排列】LeetCode 567. Permutation in String
[字符串全排列]LeetCode 567. Permutation in String Solution1:[超时,未能AC] 得到s1的所有全排列组合,然后在s2中查找s1的全排列集合因为超时,未 ...
leetcode 678. Valid Parenthesis String | 678. 有效的括号字符串（带缓存的暴力递归）
题目 https://leetcode.com/problems/valid-parenthesis-string/ 题解带缓存的暴力递归,非常挫.用一个 string 模拟 stack,方便缓存记 ...
LeetCode算法题-Repeated String Match（Java实现）
这是悦乐书的第289次更新,第307篇原创 01 看题和准备今天介绍的是LeetCode算法题中Easy级别的第156题(顺位题号是686).给定两个字符串A和B,找到A必须重复的最小次数,使得B是 ...
leetcode easy problem set
*勿以浮沙筑高台* 持续更新........ 题目网址:https://leetcode.com/problemset/all/?difficulty=Easy 1. Two Sum [4m ...
leetcode算法题--Magical String
原题链接:https://leetcode.com/problems/magical-string/ int magicalString(int n) {string s = "122&qu ...
LeetCode - Easy - 696. Count Binary Substrings
Topic String Description https://leetcode.com/problems/count-binary-substrings/ Give a string s, cou ...
LeetCode - Easy - 14. Longest Common Prefix
Topic String Description https://leetcode.com/problems/longest-common-prefix/ Write a function to fi ...
LeetCode - Easy - 191. Number of 1 Bits
Topic Bit Manipulation Description https://leetcode.com/problems/number-of-1-bits/ Write a function ...

[LeetCode][easy]Reformat The String

[LeetCode][easy]Reformat The String相关推荐

最新文章

热门文章