zoukankan      html  css  js  c++  java
  • [leetcode]Text Justification @ Python

    原题地址:https://oj.leetcode.com/problems/text-justification/

    题意:

    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."]
    L16.

    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.

    解题思路:这道题主要是要考虑的细节比较多,要编写正确不是很容易。

    代码:

    class Solution:
        # @param words, a list of strings
        # @param L, an integer
        # @return a list of strings
        def fullJustify(self, words, L):
            res=[]
            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<=L: size=newsize
                    else: break
                    i+=1
                spaceCount=L-size
                if i-begin-1>0 and i<len(words):
                    everyCount=spaceCount/(i-begin-1)
                    spaceCount%=i-begin-1
                else:
                    everyCount=0
                j=begin
                while j<i:
                    if j==begin: s=words[j]
                    else:
                        s+=' '*(everyCount+1)
                        if spaceCount>0 and i<len(words):
                            s+=' '
                            spaceCount-=1
                        s+=words[j]
                    j+=1
                s+=' '*spaceCount
                res.append(s)
            return res
  • 相关阅读:
    MarkDownPad2 注册码
    如何让你的.vue在sublime text 3 中变成彩色?
    字典树入门
    博弈论
    复杂度问题
    gets scanf以及缓冲区域的问题
    对象
    矩阵转置的一般算法
    二叉树的建立、遍历、叶子节点计数、深度计算
    D
  • 原文地址:https://www.cnblogs.com/zuoyuan/p/3782107.html
Copyright © 2011-2022 走看看