题意:给出一个字符串单词数组words及每行的最大字符个数maxLen,将字符数组排版,使得每行字符不超过maxLen,单词与单词之间有空格,并且单词与单词之间的空格尽量均匀,如果不能满足均匀,那么左边的比右边的空格多,并且要求最后一行单词与单词之间仅有一个空格。
思路:先求出一行中满足单词与单词之间仅有一个空格且长度不会超过maxLen时,能够放多少个单词,然后确定单词与单词之间的空格数。
代码如下:
public class Solution
{
public List<String> fullJustify(String[] words, int maxWidth)
{
List<String> ans = new ArrayList<>();
for (int i = 0, k = 0, l; i < words.length; i += k)
{
for (k = l = 0; i + k < words.length && l + words[i + k].length() <= maxWidth - k; k++)
{
l += words[i + k].length();
}
StringBuilder tmp = new StringBuilder(words[i]);
for (int j = 0; j < k - 1; j++)
{
if (i + k >= words.length) tmp.append(" ");
else
{
int len = (maxWidth - l) / ( k - 1) + ((j < (maxWidth - l) % (k - 1)) ? 1 : 0);
for (int n = 0; n < len; n++) tmp.append(" ");
}
tmp.append(words[i + j + 1]);
}
int len = maxWidth - tmp.length();
for (int n = 0; n < len; n++)
{
tmp.append(" ");
}
ans.add(tmp.toString());
}
return ans;
}
}