Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidthcharacters 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 maxWidth 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.
Note:
- A word is defined as a character sequence consisting of non-space characters only.
- Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
- The input array
wordscontains at least one word.
Example 1:
Input: words = ["This", "is", "an", "example", "of", "text", "justification."] maxWidth = 16 Output: [ "This is an", "example of text", "justification. " ]
Example 2:
Input: words = ["What","must","be","acknowledgment","shall","be"] maxWidth = 16 Output: [ "What must be", "acknowledgment ", "shall be " ] Explanation: Note that the last line is "shall be " instead of "shall be", because the last line must be left-justified instead of fully-justified. Note that the second line is also left-justified becase it contains only one word.
Example 3:
Input: words = ["Science","is","what","we","understand","well","enough","to","explain", "to","a","computer.","Art","is","everything","else","we","do"] maxWidth = 20 Output: [ "Science is what we", "understand well", "enough to explain to", "a computer. Art is", "everything else we", "do " ]
public class Solution{
public List<String> fullJustify(String[] words, int maxLength) {
List<String> res = new ArrayList<>();
final int n = words.length;
int begin = 0;
int len = 0;
for (int i = 0; i < n; i++) {
if (words[i].length() + len + i - begin > maxLength) {
res.add(connect(words, begin, i - 1, len, maxLength, false));
len = 0;
begin = i;
}
len += words[i].length();
}
res.add(connect(words, begin, n - 1, len, maxLength, true));
return res;
}
private String connect(String[] words, int begin, int end, int len, int L, boolean isLast) {
StringBuilder sb = new StringBuilder();
int n = end - begin + 1;
for (int i = 0; i < n; i++) {
sb.append(words[begin + i]);
addSpace(sb, i, n - 1, L - len, isLast);
}
int m = L - sb.length();
for (int j = 0; j < m; j++)
sb.append(' ');
return sb.toString();
}
private void addSpace(StringBuilder sb, int i, int n, int total, boolean isLast) {
if (n < 1 || i > n - 1) return;
int space = isLast? 1 : total / n + (i < total % n ? 1 : 0);
for (int j = 0; j < space; j++) {
sb.append(' ');
}
}
}
本文介绍了一个文本格式化算法,该算法能够将给定的单词数组按照指定的最大宽度进行完全左对齐和右对齐的排版。通过贪婪的方法尽可能多地在每一行中放置单词,并在必要时插入额外的空格,确保每行达到指定的最大宽度。

396

被折叠的 条评论
为什么被折叠?



