Leetcode 68 Text 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.

大模拟，写了很冗长的代码，wa了无数次终于过了，后来看到了简介的版本，对着重写了一份，详见注释！

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> result;
        for(int i=0,k,l;i<words.size();i+=k)
        {
            for(k=l=0;i+k<words.size() && l+words[i+k].size()<=maxWidth-k;k++) 
                l+=words[i+k].size(); //找出一行单词的个数k和总字母数l
            string temp=words[i]; //将第一个单词放入
            for(int j=0;j<k-1;j++)
            {
                if(i+k>=words.size()) //如果是最后一行
                    temp+=' ';
                else
                    temp+=string((maxWidth-l)/(k-1)+(j<(maxWidth-l)%(k-1)),' ');//精髓：单词之间的空格
                temp+=words[i+j+1];
            }
            temp+=string(maxWidth-temp.size(),' ');//补全空格
            result.push_back(temp);
        }
        return result;
    }
};