Text Justification

Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth 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 maxWidth 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.

Note:

• 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.

Example 1:

Input:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
Output:
[
   "This    is    an",
   "example  of text",
   "justification.  "
]

思路：看 https://www.youtube.com/watch?v=6D7YFoQ4t0w 视频的讲解，写的，很容易直观；

就是分清楚细节，然后coding就可以了，每次算出来是哪个[i:j] 形成一行，单独写个函数printline，然后最后一行j == words.length - 1特殊处理一下；printline是要分成三段处理，先算出空格，然后算出extra，然后形成line；比较清晰；清华的就是不一样；

class Solution {
    public List<String> fullJustify(String[] words, int maxWidth) {
        List<String> res = new ArrayList<String>();
        for(int i = 0; i < words.length; i++) {
            int j = i; 
            int count = 0;
            while(j < words.length && count <= maxWidth) {
                if(j == i) {
                    count += words[j].length();
                } else {
                    count += 1 + words[j].length();
                }
                j++;
            }
            j--; //只是对应上面个j++;
            
            //j还需要吐出最后一个；
            if(count > maxWidth) {
                count -= 1 + words[j].length();
                j--;
            }
            
            // words[i:j];
            if(j == words.length - 1) {
                // 最后一行，特殊处理；
                String temp = "";
                for(int k = i; k <= j; k++) {
                    if(k == j) {
                        temp += words[k];
                    } else {
                        temp += words[k] + " ";
                    }
                }
                temp += addSpace(maxWidth - temp.length());
                res.add(temp);
            } else {
                // 否则加入printline；
                res.add(printline(words, i, j, maxWidth));
            }
            i = j;
        }
        return res;
    }
    
    private String printline(String[] words, int a, int b, int maxWidth) {
        if(a == b) {
            return words[a] + addSpace(maxWidth - words[a].length());
        }
        
        int totalletters = 0;
        for(int i = a; i <= b; i++) {
            totalletters += words[i].length();
        }
        int spaces = (maxWidth - totalletters) / (b - a);
        // calculate extra -> k;
        int k = (maxWidth - totalletters) % (b - a);
        String res = "";
        //分成三段；
        for(int i = a; i < a + k; i++) {
            res += words[i] + addSpace(spaces + 1);
        }
        for(int i = a + k; i < b; i++) {
            res += words[i] + addSpace(spaces);
        }
        res += words[b];
        return res;
    }
    
    private String addSpace(int len) {
        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < len; i++) {
            sb.append(" ");
        }
        return sb.toString();
    }
}