68. Text Justification

09/18/2021

Leetcode

Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth 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 maxWidth characters.

Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line does 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 words contains 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                  "
]

Constraints:

  • 1 <= words.length <= 300

  • 1 <= words[i].length <= 20

  • words[i] consists of only English letters and symbols.

  • 1 <= maxWidth <= 100

  • words[i].length <= maxWidth

Basic Idea:

基本思路就是先确定每一行有哪些单词,然后逐行处理。需要注意的是只有一个单词的行以及最后一行。

Java Code:

class Solution {
    public List<String> fullJustify(String[] words, int maxWidth) {
        List<String> ret = new ArrayList<>();
        
        List<String> line = new ArrayList<>();
        int len = 0;
        for (int i = 0; i < words.length; ++i) {
            len = len == 0 ? words[i].length() : len + words[i].length() + 1;
            line.add(words[i]);
            if (i == words.length - 1 || len + 1 + words[i + 1].length() > maxWidth) {
                ret.add(processLine(line, maxWidth, i == words.length - 1));
                line.clear();
                len = 0;
            }
        }
        return ret;
    }
    
    private String processLine(List<String> words, int maxWidth, boolean isLastLine) {
        StringBuilder sb = new StringBuilder();
        int totalWordsLen = 0;
        for (String word : words) {
            totalWordsLen += word.length();
        }
        int totalSpace = maxWidth - totalWordsLen;
        if (!isLastLine) {
            int spacePerSlot = words.size() > 1 
                ? totalSpace / (words.size() - 1)
                : 0;
            int leftSpace = words.size() > 1 
                ? totalSpace % (words.size() - 1)
                : totalSpace;
            for (int i = 0; i < words.size(); ++i) {
                sb.append(words.get(i));
                if (i < words.size() - 1) {
                    if (leftSpace > 0) {
                        sb.append(" ");
                        leftSpace--;
                    }
                    for (int j = 0; j < spacePerSlot; ++j) {
                        sb.append(" ");
                    }
                }
            }
            while (leftSpace > 0) {
                sb.append(" ");
                leftSpace--;
            }
        } else {
            for (int i = 0; i < words.size(); ++i) {
                sb.append(words.get(i));
                if (i < words.size() - 1) {
                    sb.append(" ");
                }
            };
            while (sb.length() < maxWidth) {
                sb.append(" ");
            }
        }
        return sb.toString();
    }
}

Last updated