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
  • 相关阅读:
    快速搭建一个本地的FTP服务器
    Node.js安装及环境配置之Windows篇
    在win10上安装oracle10g
    win10安装oracle11g客户端
    解决:Java source1.6不支持diamond运算符,请使用source 7或更高版本以启用diamond运算符
    idea 右侧 无 meven 菜单
    idea导入maven项目不能识别pom.xml文件解决办法
    PostgresSQL客户端pgAdmin4使用
    PostgreSQL 创建数据库
    PostgreSQL 数据类型
  • 原文地址:https://www.cnblogs.com/zuoyuan/p/3782107.html
Copyright © 2011-2022 走看看