leetcode 68. Text Justification

Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth 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 maxWidth 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.

Note:

  • A word is defined as a character sequence consisting of non-space characters only.
  • Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
  • The input array words contains at least one word.

Example 1:

Input:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
Output:
[
   "This    is    an",
   "example  of text",
   "justification.  "
]

Example 2:

Input:
words = ["What","must","be","acknowledgment","shall","be"]
maxWidth = 16
Output:
[
  "What   must   be",
  "acknowledgment  ",
  "shall be        "
]
Explanation: Note that the last line is "shall be    " instead of "shall     be",
             because the last line must be left-justified instead of fully-justified.
             Note that the second line is also left-justified becase it contains only one word.

Example 3:

Input:
words = ["Science","is","what","we","understand","well","enough","to","explain",
         "to","a","computer.","Art","is","everything","else","we","do"]
maxWidth = 20
Output:
[
  "Science  is  what we",
  "understand      well",
  "enough to explain to",
  "a  computer.  Art is",
  "everything  else  we",
  "do                  "
]

题目贪心策略左右对齐排版。

因为是贪心策略,所以还是很简单的。一行一行的排版即可。复杂度是O(n)。代码如下:

class Solution(object):
    def fullJustify(self, words, maxWidth):
        """
        :type words: List[str]
        :type maxWidth: int
        :rtype: List[str]
        """
        ret = []
        tmpLine = []
        tmpLineWords = []
        tmpLineWordLenSum = 0
        for word in words:
            l = len(word)
            if tmpLineWordLenSum + l + len(tmpLineWords) <= maxWidth:
                tmpLineWords.append(word)
                tmpLineWordLenSum += l
            else:
                if len(tmpLineWords) == 1:
                    tmpLine =[ tmpLineWords[0] , " "*(maxWidth-tmpLineWordLenSum)]
                else:
                    minBlockNum = (maxWidth - tmpLineWordLenSum)//(len(tmpLineWords)-1)
                    maxBlockCount = (maxWidth - tmpLineWordLenSum) - minBlockNum*(len(tmpLineWords)-1)
                    tmpLine = [tmpLineWords[0]]
                    blocks = " "*minBlockNum
                    blockAdd1s = " "*(minBlockNum+1)
                    for i in range(1,len(tmpLineWords)):
                        if i <= maxBlockCount:
                            tmpLine.append(blockAdd1s)
                        else:
                            tmpLine.append(blocks)
                        tmpLine.append(tmpLineWords[i])
                ret.append("".join(tmpLine))
                tmpLine = []
                tmpLineWords = [word]
                tmpLineWordLenSum = l
        #最后一行
        if tmpLineWordLenSum > 0:
            tmpStr = " ".join(tmpLineWords)
            ret.append(tmpStr+" "*(maxWidth-len(tmpStr)))
        return ret

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值