[Leetcode]68. Text Justification @python

题目

Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.

You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces ’ ’ when necessary so that each line has exactly L characters.

Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right.

For the last line of text, it should be left justified and no extra space is inserted between words.

For example,
words: [“This”, “is”, “an”, “example”, “of”, “text”, “justification.”]
L: 16.

Return the formatted lines as:
[
“This is an”,
“example of text”,
“justification. ”
]
Note: Each word is guaranteed not to exceed L in length.

click to show corner cases.

Corner Cases:
A line other than the last line might contain only one word. What should you do in this case?
In this case, that line should be left-justified.

题目要求

给定一个单词列表和语句长度L，要求将单词列表中的单词进行输出，输出语句每行长度为L右列表中的单词和空格组成，且空格要尽量均匀分布，如果不能均匀分布，则在左边的单词之间输出更多的空格。最后一行不进行空格的均匀分布，在单词的右端用空格补齐空位。

解题思路

此题代码参考南郭子綦.
代码逻辑主要分为以下几部分：
1. 计算每行最多显示单词的数量，记录起始单词位置（结束指针单词不包含在内），这里要注意，单词与单词之间的都要求有空格，所以除了开始的单词，每个单词的长度还要加1
2. 计算显示每句话需要的空格的数量
3. 计算每句话中单词之间需要均匀填充的空格数量。这里要注意最后一行不需要进行均匀填充，不能均匀填充的空格数量要记录下来，优先分给左边的单词间空格
4. 按照之前计算好的空格数量将单词连接成语句。
5. 要考虑到最后一句是在最右端填充所有的空格

代码

class Solution(object):
    def fullJustify(self, words, maxWidth):
        """
        :type words: List[str]
        :type maxWidth: int
        :rtype: List[str]
        """
        ans = []
        i = 0
        while i < len(words):
            size = 0
            begin = i
            while i < len(words):
                newsize = len(words[i]) if size == 0 else size + len(words[i]) + 1
                if newsize <= maxWidth: 
                    size = newsize
                    i += 1
                else:
                    break
            spaceCount = maxWidth - size
            if i - 1 - begin > 0 and i < len(words):
                everyCount = spaceCount / (i - 1 - begin)
                spaceCount %= (i - 1 - begin)
            else:
                everyCount = 0
            j = begin
            s = ''
            while j < i:
                if j > begin:
                    s += ' ' * (everyCount + 1)
                    if spaceCount > 0 and i < len(words):
                        s += ' '
                        spaceCount -= 1
                s += words[j]
                j += 1
            s += ' ' * spaceCount
            ans.append(s)
        return ans