68. Text Justification

最新推荐文章于 2024-03-14 13:51:38 发布

liujunzxcv

最新推荐文章于 2024-03-14 13:51:38 发布

阅读量133

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.youkuaiyun.com/liujunzxcv/article/details/78042759

LeetCode 专栏收录该内容

81 篇文章

订阅专栏

本文介绍了一种将文本按照指定长度进行格式化的方法，确保每行文本刚好达到指定长度并进行合理的换行处理。文章详细解释了如何通过贪婪算法填充单词，并在单词间均匀分布空格以达到美观的文本排版效果。

摘要生成于 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.

实现一个格式化换行的功能。

每行限定了宽度，单词之间要有空格。如果多出来空间又容不下下一个单词就补空格，从左至右在单词之间加空格即可。

最后一行正常单词间一个空格即可，在后面补空格

题目逻辑很简单，注意换行补空格即可

public static List<String> fullJustify(String[] words, int maxWidth) {
List<String> list = new ArrayList<String>();
if(words==null||words.length<1)return list;
if(words.length==1){
while(words[0].length()<maxWidth){
words[0]+=' ';
}

list.add(words[0]);
return list;
}
int count=0;
for(int i=0;i<words.length;){
String s = "";
while(s.length() < maxWidth){
if(i==words.length){//处理最后一行
s=s.trim();
while(s.length()<maxWidth){
s+=' ';
}
list.add(s);
break;
}
else if(i<words.length&&words[i].length()+s.length()<=maxWidth){
s+=words[i];
i++;
if(s.length()==maxWidth){
list.add(s);
}
else{
s+=" ";
if(s.length()==maxWidth){
s=s.trim();
s=handleSpace(s,maxWidth);
list.add(s);
}
}
}
else {//换行
s=s.trim();
s=handleSpace(s,maxWidth);
list.add(s);
}

}
}

return list;

}
public static String handleSpace(String s ,int maxWidth){
String strs[] = s.split(" ");
int count = 0;
for(int i=0;i<strs.length;i++){
count+=strs[i].length();
}
if(strs.length==1){
s=s.trim();
while(s.length()<maxWidth){
s+=' ';
}
}
else{
while(count<maxWidth){
for(int i=0;i<strs.length-1;i++){
strs[i]+=" ";
count++;
if(count==maxWidth)
break;
}
}
s="";
for(int i=0;i<strs.length;i++){
s+=strs[i];
}
}

return s;

}