input: List list, int[] width
for example
[
[‘abcdefg’, ‘abc’, ‘abcde’],
[‘ab’, ‘abcde’, ‘abcd’],
]，
[3, 3, 3]
Output:
abc | abc | abc
def | | de
g
ab | abc | abc
| de | d
follow up:
If only give you the total sum of each element in the width vector, how to find the vector of width which make the output lines minimum?