68. 文本左右对齐

68. 文本左右对齐

题目介绍

给定一个单词数组和一个长度 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                  "
]

题解

1. 如果当前行只有一个单词，特殊处理左对齐，剩余部分空格填充；
2. 如果当前行为最后一行，特殊处理左对齐，并且单词之间只有一个空格，最右边空格填充；
3. 其他情况参照题目要求，空格均匀分配，不能均匀的情况下左侧比右侧多，也就是尽量均匀，多的从左边开始依次加 1。

代码

class Solution:
    def fullJustify(self, words: List[str], maxWidth: int) -> List[str]:
        len_ = len(words)
        i = 0
        new_word_list = []
        one_word_list = []
        sum_ = 0
        while i < len_:
            word_i = words[i]
            if (one_word_list and sum_ + len(word_i) + 1 <= maxWidth) or (
                    not one_word_list and sum_ + len(word_i) <= maxWidth):
                if one_word_list:
                    sum_ += 1
                one_word_list.append(word_i)
                sum_ += len(word_i)
                i += 1
                continue
            one_word_list_len = len(one_word_list) - 1
            space_left = maxWidth - sum_
            if one_word_list_len == 0:
                # 一行只有一个单词
                new_word_list.append(one_word_list[0] + " " * space_left)
            else:
                # 一行多词
                business = space_left // one_word_list_len
                remainder = space_left % one_word_list_len
                one_word_str = (" " * (business + 2)).join(one_word_list[:remainder + 1]) + " " * (business + 1) + (
                            " " * (business + 1)).join(one_word_list[remainder + 1:])
                new_word_list.append(one_word_str)
            one_word_list = []
            sum_ = 0
        if one_word_list:
            # 最后一行
            new_word_list.append(" ".join(one_word_list) + " " * (maxWidth - sum_))
        return new_word_list

enumerate
if __name__ == '__main__':
    word_list = ["What", "must", "be", "acknowledgment", "shall", "be"]
    max_width = 16
    s = Solution()
    result = s.fullJustify(word_list, max_width)
    print(result)