Question:
Given an array of words and a length L, format the text such that each line has exactly L 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 L characters.
Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do 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.
For example,
words: ["This", "is", "an", "example", "of", "text", "justification."]
L: 16
.
Return the formatted lines as:
[ "This is an", "example of text", "justification. " ]
Note: Each word is guaranteed not to exceed L in length.
Solution:
public class Solution {
public List<String> fullJustify(String[] words, int maxWidth) {
List<String> ans= new ArrayList<String>();
if(null==words||maxWidth==0)
{
ans.add("");
return ans;
}
for(int i=0;i<=words.length-1;i++)
{
StringBuilder tmp= new StringBuilder();
//if this string[] is in the end and only like this ""
//just append it to fit the maxWidth length;
if(words[i].equals("")&&i==words.length-1)
{
for(int k=0;k<=maxWidth-1;k++)
tmp.append(" ");
ans.add(tmp.toString());
break;
}
//pre_word is to count the length of word and plus one space between the word;
int pre_word=0;
//start is to save the position of start
int start=i;
pre_word+=words[i].length();
i++;
//in case we have only one word in thsi line
if(i<=words.length-1)
{
while(pre_word+words[i].length()+1<=maxWidth)
{
pre_word+=words[i].length()+1;
i++;
if(words.length==i)
break;
}
}
//end is to save the position of end
int end=i-1;
i--;
//calculate how many spaces we should add
int space_capacity=maxWidth-pre_word+(end-start);
//calculate how many slot we can put the spaces
int space_num=end-start;
String[] _space=new String[space_num];
int each_have_space=0;
int turn_point=0;
//if we only have one word in this line is no need to calculate this things
if(space_num!=0)
{
each_have_space=space_capacity/space_num;
turn_point=(space_capacity%space_num)-1;
}
//handle the space of all the line except last line
if(!(i==words.length-1))
{
for(int j=0;j<=space_num-1;j++)
{
if(j<=turn_point)
{
_space[j]=" ";
for(int k=1;k<=each_have_space;k++)
_space[j]+=" ";
}
else
{
_space[j]=" ";
for(int k=1;k<=each_have_space-1;k++)
_space[j]+=" ";
}
}
}
//handle the space of the last line
else
{
each_have_space=1;
for(int j=0;j<=space_num-1;j++)
{
_space[j]=" ";
}
}
//combine the words and space
tmp.append(words[start]);
int bound=end-start;
for(int l=0;l<=bound-1;l++)
{
tmp.append(_space[l]);
tmp.append(words[++start]);
}
//handle the last line or the line with only one word.
while(tmp.length()<maxWidth)
tmp.append(" ");
ans.add(tmp.toString());
}
return ans;
}
}