给定一个单词数组和一个长度 maxWidth,重新排版单词,使其成为每行恰好有 maxWidth 个字符,且左右两端对齐的文本。
你应该使用“贪心算法”来放置给定的单词;也就是说,尽可能多地往每行中放置单词。必要时可用空格 ' ' 填充,使得每行恰好有 maxWidth 个字符。
要求尽可能均匀分配单词间的空格数量。如果某一行单词间的空格不能均匀分配,则左侧放置的空格数要多于右侧的空格数。
文本的最后一行应为左对齐,且单词之间不插入额外的空格。
说明:
- 单词是指由非空格字符组成的字符序列。
- 每个单词的长度大于 0,小于等于 maxWidth。
- 输入单词数组 words 至少包含一个单词。
示例:
输入:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
输出:
[
"This is an",
"example of text",
"justification. "
]
示例 2:
输入:
words = ["What","must","be","acknowledgment","shall","be"]
maxWidth = 16
输出:
[
"What must be",
"acknowledgment ",
"shall be "
]
解释: 注意最后一行的格式应为 "shall be " 而不是 "shall be",
因为最后一行应为左对齐,而不是左右两端对齐。
第二行同样为左对齐,这是因为这行只包含一个单词。
示例 3:
输入:
words = ["Science","is","what","we","understand","well","enough","to","explain",
"to","a","computer.","Art","is","everything","else","we","do"]
maxWidth = 20
输出:
[
"Science is what we",
"understand well",
"enough to explain to",
"a computer. Art is",
"everything else we",
"do "
]
解题思路:个人未想到特定的算法适合解决此类问题,按照题目所给要求解题。
利用两个变量begin和end,[begin, end)表示可放在同一行的单词的下标起始位置(左闭右开区间),然后判断是否为一个单词占一行或者最后一行,左对齐;否则,左右对齐。
java代码:
class Solution {
public List<String> fullJustify(String[] words, int maxWidth) {
List<String> res = new LinkedList();
int begin , end = 0;//begin、end为下标,每层for循环中,[begin, end)表示可放在同一行的单词的下标起始位置
for(int i =0; i< words.length; ) {
begin = end;
//判断哪些单词可放在同一行
int sumLen = 0;
while(end < words.length) {
sumLen += (end > begin ? 1 : 0) + words[end].length();
if(sumLen <= maxWidth)
end++;
else
break;
}
//一个单词占一行或最后一行,左对齐
if(end == words.length || end == begin+1){
StringBuilder sb = new StringBuilder(maxWidth);
for(int l = begin; l < end; l++){
sb.append(words[l] + " ");
}
sb.deleteCharAt(sb.length()-1);
while(sb.length() < maxWidth){
sb.append(" ");
}
res.add(sb.toString());
} else { //左右对齐
//相邻单词之间的空格数
int spaceCnt = (maxWidth - (sumLen - words[end].length()-1))/(end-begin-1) + 1;
int mod = (maxWidth - (sumLen - words[end].length()-1))%(end-begin-1);
StringBuilder sb = new StringBuilder(maxWidth);
for(int l = begin; l < end-1; l++){
sb.append(words[l]);
for(int j = 0; j < spaceCnt; j++)
sb.append(" ");
//空格数不能完全分配时,左侧空格数多于右侧空格数
if(l-begin < mod)
sb.append(" ");
}
res.add(sb.append(words[end-1]).toString());
}
i = end;
}
return res;
}
}