题目
给定一个单词数组 words
和一个长度 maxWidth
,重新排版单词,使其成为每行恰好有 maxWidth
个字符,且左右两端对齐的文本。
你应该使用 “贪心算法” 来放置给定的单词;也就是说,尽可能多地往每行中放置单词。必要时可用空格 ' '
填充,使得每行恰好有 maxWidth 个字符。
要求尽可能均匀分配单词间的空格数量。如果某一行单词间的空格不能均匀分配,则左侧放置的空格数要多于右侧的空格数。
文本的最后一行应为左对齐,且单词之间不插入额外的空格。
注意:
- 单词是指由非空格字符组成的字符序列。
- 每个单词的长度大于 0,小于等于 maxWidth。
- 输入单词数组
words
至少包含一个单词。
示例 1:
输入: words = ["This", "is", "an", "example", "of", "text", "justification."], maxWidth = 16 输出: [ "This is an", "example of text", "justification. " ]
示例 2:
输入:words = ["What","must","be","acknowledgment","shall","be"], maxWidth = 16 输出: [ "What must be", "acknowledgment ", "shall be " ] 解释: 注意最后一行的格式应为 "shall be " 而不是 "shall be", 因为最后一行应为左对齐,而不是左右两端对齐。 第二行同样为左对齐,这是因为这行只包含一个单词。
示例 3:
输入:words = ["Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"],maxWidth = 20 输出: [ "Science is what we", "understand well", "enough to explain to", "a computer. Art is", "everything else we", "do " ]
提示:
1 <= words.length <= 300
1 <= words[i].length <= 20
words[i]
由小写英文字母和符号组成1 <= maxWidth <= 100
words[i].length <= maxWidth
代码
public List<String> fullJustify(String[] words, int maxWidth) {
ArrayList<String> list = new ArrayList<>();
int right=0;
int n=words.length;
while(true){
int left=right;
int len=0;
while(right<n&&len+words[right].length()+(right-left)<=maxWidth){
len+=words[right++].length();
}
if(right==n){
StringBuffer okk = join(words, left, n, " ");
okk.append(blank(maxWidth- okk.length()));
list.add(okk.toString());
return list;
}
int numsword=right-left;
int numsspace=maxWidth-len;
if(numsword==1)
{
StringBuffer ok = new StringBuffer(words[left]);
ok.append(blank(numsspace));
list.add(ok.toString());
}
else {
int avg=numsspace/(numsword-1);
int extra=numsspace%(numsword-1);
StringBuffer ok = new StringBuffer();
ok.append(join(words,left,left+extra+1,blank(avg+1)));
ok.append(blank(avg));
ok.append(join(words,left+extra+1,right,blank(avg)));
list.add(ok.toString());
}
}
}
public StringBuffer join(String[] words,int left,int right,String sep)
{
StringBuffer ok = new StringBuffer(words[left]);
for(int i=left+1;i<right;i++)
{ok.append(sep);
ok.append(words[i]);
}
return ok;
}
public String blank(int n)
{
StringBuffer ok = new StringBuffer();
for(int i=0;i<n;i++)
{
ok.append(' ');
}
return ok.toString();
}
思路
首先通过while确定一行可以存放几个单词,如果只能放一个单词,则左对齐后面全补齐空格,else则 int avg=numsspace/(numsword-1);表示的是求出最少两个单词中的间隔的空格数,减一是因为第一个单词左对齐, int extra=numsspace%(numsword-1);求出剩余没有计算的空格,将没有计算的空格分别给前面的extra个单词前加上,再把剩余的append在末尾,当right=n的时候就是所有的单词都遍历完成。由于join是对于数组作左闭右开的处理,并且数组的下边最后一个为n-1,所以最后一个始终会留给这一步处理。