LeetCode OJ-- Text Justification

https://oj.leetcode.com/problems/text-justification/

细节题

class Solution {
public:
    vector<string> fullJustify(vector<string> &words, int L) {
        vector<string> ans;

        if(L == )
        {
            ans.push_back("");
            return ans;
        }

        int index = ;
        int begin = ;
        int tempLen = ;
        int end = ;
        int spaces = ;
        int extraSpace = ;
        while(index < words.size())
        {
            begin = index;
            tempLen = words[index].size();
            index++;
            while(index < words.size() && (tempLen +  + words[index].size()) <= L)
            {
                tempLen = tempLen +  + words[index].size();
                index++;
            }
            end = index - ;
            string str;
            // not the last line
            if(end != words.size() - )
            {
                // has more than one word
                if(end != begin)
                {
                    spaces = (L - tempLen) / (end - begin);
                    extraSpace = (L - tempLen) % (end - begin);
                    string strSpace;
                    for(int i = ; i < spaces + ; i++)
                    strSpace.append(" ");
                    for(int p = begin; p < end; p++)
                    {
                        str.append(words[p]);
                        str.append(strSpace);
                        if(p - begin < extraSpace)
                            str.append(" ");
                    }
                    str.append(words[end]);
                }
                else
                {
                    str.append(words[begin]);
                    while(str.size() < L)
                        str.append(" ");
                }
            }
            else
            {
                for(int p = begin; p < end; p++)
                {
                    str.append(words[p]);
                    str.append(" ");
                }
                str.append(words[end]);
                while(str.size() < L)
                    str.append(" ");
            }
            ans.push_back(str);
        }
        return ans;
    }
};