Text Justification

饭没了吃

于 2015-09-16 08:20:35 发布

阅读量447

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/u014734779/article/details/48488787

leetcode 专栏收录该内容

149 篇文章

订阅专栏

本文介绍了如何通过一种贪婪的方法，将单词数组中的文本按照指定长度进行格式化，并确保每行文字左右对齐。具体步骤包括打包尽可能多的单词到每一行、在必要时填充额外的空格，以及对空格进行均匀分配。对于最后一行，采取左对齐策略，不插入多余的空格于单词之间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.
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