给定一个单词数组 words 和一个长度 maxWidth ,重新排版单词,使其成为每行恰好有 maxWidth 个字符,且左右两端对齐的文本。
你应该使用 “贪心算法” 来放置给定的单词;也就是说,尽可能多地往每行中放置单词。必要时可用空格 ’ ’ 填充,使得每行恰好有 maxWidth 个字符。
要求尽可能均匀分配单词间的空格数量。如果某一行单词间的空格不能均匀分配,则左侧放置的空格数要多于右侧的空格数。
文本的最后一行应为左对齐,且单词之间不插入额外的空格。
注意:
单词是指由非空格字符组成的字符序列。
每个单词的长度大于 0,小于等于 maxWidth。
输入单词数组 words 至少包含一个单词。
示例 1:
输入: 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 "
]
提示:
1 <= words.length <= 300
1 <= words[i].length <= 20
words[i] 由小写英文字母和符号组成
1 <= maxWidth <= 100
words[i].length <= maxWidth
贪心,分了两步,还能优化成一个循环完成。
class Solution:
def fullJustify(self, words: List[str], maxWidth: int) -> List[str]:
# 贪心,先找到每行的字符串
res = []
count, line = 0, ""
while count < len(words):
if line == "" and len(words[count]) == maxWidth:
line = words[count]
elif len(line) + len(words[count]) + 1 <= maxWidth:
line = " ".join([line, words[count]]).lstrip()
else:
res.append(line)
line = words[count]
if count == len(words) - 1:
res.append(line)
count += 1
# 均分空格
_res = []
for s in res:
need_blank_count = maxWidth - len(s)
_words = s.split(" ")
_words_len = len(_words)
if _words_len == 1:
_res.append(_words[0] + " " * need_blank_count)
continue
_cs = []
for i, w in enumerate(_words):
if i == _words_len - 1:
_cs.append(w)
break
_cs.append(
w
+ " "
* (
need_blank_count // (_words_len - 1)
+ ((i + 1) <= need_blank_count % (_words_len - 1))
)
)
_res.append(" ".join(_cs))
_res[-1] = " ".join(_res[-1].split())
_res[-1] = _res[-1] + " " * (maxWidth - len(_res[-1]))
return _res