-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1592.重新排列单词间的空格.java
55 lines (52 loc) · 1.45 KB
/
1592.重新排列单词间的空格.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
54
import java.util.Arrays;
/*
* @lc app=leetcode.cn id=1592 lang=java
*
* [1592] 重新排列单词间的空格
*/
// @lc code=start
class Solution {
public String reorderSpaces(String text) {
int cnt = 0;
for(char c: text.toCharArray()){
if(c == ' '){
++cnt;
}
}
if(cnt == 0){
return text;
}
String[] words = text.split("\\s+");
int n = words.length;
if(words[0].equals("")){
for(int i = 0;i < n - 1;++i){
words[i] = words[i + 1];
}
n = n - 1;
}
if(n == 1){
StringBuilder stringBuilder = new StringBuilder();
stringBuilder.append(words[0]);
for(int j = 0;j < cnt;++j){
stringBuilder.append(' ');
}
return stringBuilder.toString();
}
int average = cnt / (n -1);
int remain = cnt - average * (n - 1);
StringBuilder stringBuilder = new StringBuilder();
stringBuilder.append(words[0]);
char[] temp = new char[average];
Arrays.fill(temp, ' ');
String blank = new String(temp);
for(int i = 1;i < n;++i){
stringBuilder.append(blank);
stringBuilder.append(words[i]);
}
for(int i = 0;i < remain;++i){
stringBuilder.append(' ');
}
return stringBuilder.toString();
}
}
// @lc code=end