EPIJ 16.11 Pretty printing problem variant 2


#1

For variant 2 of this problem, to minimize the messiness in O(n) time and O(1) space, is it sufficient to maximize the number of words on each line, and minimize the number of lines?