Statement

You are given an array of strings, words, and an integer, maxWidth. Your task is to reformat the text by arranging the words into lines of a specified width. Each line must have exactly maxWidth characters.

Words should be packed into lines using a greedy approach, which means you should fit as many words as possible onto each line before moving to the next. For this purpose, if the length of the words is less than the maxWidth, then add empty spaces ‘ ’ to adjust the length of each line.

The formatting rules are as follows:

For all lines except the last one, distribute extra spaces between words as evenly as possible to align both left and right.
If the spaces don’t divide evenly, the leftmost gaps should receive the extra spaces ‘ ’.
The last line of text and any line with only a single word must be left-justified. This means words are separated by a single space separates words, and the remaining width is filled with spaces on the right.

You can assume the following:

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.

Constraints:

$1 \leq$ words.length $\leq 300$
$1 \leq$ words[i].length $\leq 20$
words[i] consists of only English letters and symbols. ...