Leetcode-Test Justification

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.

Analysis:

For each line, the first word does not need space, for each of the following words, we need count one space. In this way, we find out the words fit into the current line, then construct the string of the current line.

After finding out all words in the current line, we calculate the number of space between each words. Suppose the total number of space is totalSpace, then we should add (totalSpace/(wordNum-1)) between words. In addition, we have (totalSpace%(wordNum-1)) number of space left, we add them from left to right into each gap. NOTE: a special case is that there is only one word in the current line, we then add all spaces after the word.

For the last line, we just add one space in each gap and then add the left spaces on the end of the line.

Solution:

 public class Solution {
     public List<String> fullJustify(String[] words, int L) {
         List<String> res = new ArrayList<String>();
         int index = 0;
         int totalSpace=-1, aveSpace=-1, leftSpace=-1;

         while (index<words.length){
             int curLen = 0;
             List<String> lineWord = new ArrayList<String>();
             lineWord.add(words[index]);
             curLen = words[index].length();
             index++;
             while (index<words.length && curLen+words[index].length()+1<=L){
                 lineWord.add(words[index]);
                 curLen += words[index].length()+1;
                 index++;
             }
             int wordNum = lineWord.size();

             //if it is not the last line.
             if (index<words.length){
                 if (wordNum>1){
                     totalSpace = L-curLen+(wordNum-1);
                     aveSpace = totalSpace/(wordNum-1);
                     leftSpace = totalSpace%(wordNum-1);
                     String space = "";
                     for (int i=0;i<aveSpace;i++) space = space+" ";
                     String lineStr = lineWord.get(0);
                     for (int i=1;i<lineWord.size();i++){
                         lineStr += space;
                         if (leftSpace>0){
                             lineStr += " ";
                             leftSpace--;
                         }
                         lineStr += lineWord.get(i);
                     }
                     res.add(lineStr);
                 } else {
                     totalSpace = L-lineWord.get(0).length();
                     String lineStr = lineWord.get(0);
                     for (int i=0;i<totalSpace;i++) lineStr += " ";
                     res.add(lineStr);
                 }
             } else {
                 leftSpace = L-curLen;
                 String lineStr = lineWord.get(0);
                 for (int i=1;i<wordNum;i++) lineStr += " "+lineWord.get(i);
                 for (int i=0;i<leftSpace;i++) lineStr += " ";
                 res.add(lineStr);
             }

         }

         return res;
     }
 }