forked from oleg-cherednik/DailyCodingProblem
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
53 lines (41 loc) · 1.37 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/**
* @author Oleg Cherednik
* @since 08.03.2020
*/
public class Solution {
public static void main(String... args) {
System.out.println(rearrange("aaabbc")); // ababac
System.out.println(rearrange("a")); // a
System.out.println(rearrange("aaab")); // None
System.out.println(rearrange("")); // None
}
public static String rearrange(String str) {
char[] arr = groupLetters(str);
if (arr == null)
return "None";
for (int i = 1, lst = arr.length - 1; i < arr.length; i++) {
if (arr[i] != arr[i - 1])
continue;
if (arr[i] == arr[lst])
return "None";
arr[i] = arr[lst];
arr[lst] = arr[i - 1];
}
return new String(arr);
}
private static char[] groupLetters(String str) {
if (str == null || str.isEmpty())
return null;
if (str.length() == 1)
return str.toCharArray();
int[] counts = new int[26];
str = str.toLowerCase();
for (int i = 0; i < str.length(); i++)
counts[str.charAt(i) - 'a']++;
char[] arr = new char[str.length()];
for (int i = 0, j = 0; i < counts.length; i++)
for (int k = 0; k < counts[i]; k++)
arr[j++] = (char)('a' + i);
return arr;
}
}