Leetcode 68. Text Justification

Gary Chiang
2 min readAug 5, 2021



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.


  • 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
"This is an",
"example of text",
"justification. "

Example 2:

Input: words = ["What","must","be","acknowledgment","shall","be"], maxWidth = 16
"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.


  1. divid and conquer, and seperate to small function.
  2. first, find each line words, last line need to be on the left justify.
  3. justify each line, need to count the space and distribute the space between words



Gary Chiang

CS new grad, 6 years experience related to supply chain management. Located in Bay area