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.

代码一：自己的代码，0 ms AC，注释很详细，但可能代码长度有点长

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int L)
    {
        vector<string> result;
        int len = words.size();
        int left = 0, right = 0;        //每一行放入的单词在words表中的下表范围
        int tmp_len = 0;

        while(left <= len-1)
        {
            right = left;
            tmp_len += words[right].length();
            tmp_len++;      //本身有一个空格
            while(tmp_len<=L && right<len-1)
            {
                right++;
                tmp_len += words[right].length();
                tmp_len++;
                if(tmp_len > L+1)       //最后一个 right 最后边暂时不用加空格
                {
                    right--;    //右边界是right
                    tmp_len -= words[right+1].length();     //还原出真实的tmp_len
                    tmp_len--;
                    break;
                }
                else if(tmp_len==L || tmp_len == L+1)
                    break;
            }
            string tmp = "";
            if(right == left)       //只有一个单词，左对齐
            {
                tmp += words[left];
                for(int i=0;i<L-words[left].size();i++)
                    tmp += " ";
                result.push_back(tmp);
            }
            else
            {
                if(right == len-1)      //最后一行，直接左对齐
                {
                    for(int i=left;i<=right;i++)
                    {
                        tmp += words[i];
                        tmp += " ";
                    }
                    int add_num = L-tmp.length();
                    for(int i=0;i<add_num;i++)
                        tmp += " ";
                }
                else
                {
                    tmp_len -= (right-left+1);
                    int white = L-tmp_len;
                    int num = right - left;        //间隙的个数
                    if(white%num == 0)
                    {
                        for(int i=left;i<=right;i++)
                        {
                            tmp += words[i];
                            if(i == right)      //最后一个单词后面不用加空格
                                break;

                            for(int j=0;j<white/num;j++)        //分配中间的空格
                                tmp += " ";
                        }
                    }
                    else
                    {
                        for(int i=left;i<=right;i++)
                        {
                            tmp += words[i];
                            if(i == right)
                                break;
                            int w_num = white/num;
                            if(i < left+(white%num))
                                w_num++;
                            for(int j=0;j<w_num;j++)
                                tmp += " ";
                        }
                    }
                }

                result.push_back(tmp);
            }
            left = right+1;
            tmp_len = 0;
        }

        return result;
    }
};

代码二：discussion区的代码，3 ms AC，很简略，但是稍微慢了一点

class Solution {
public:
    vector<string> fullJustify(vector<string> &words, int L) {
        vector<string> res;
        for(int i = 0, k, l; i < words.size(); i += k) 
        {
            for(k = l = 0; i + k < words.size() and l + words[i+k].size() <= L - k; k++) 
            {
                l += words[i+k].size();
            }
            string tmp = words[i];
            for(int j = 0; j < k - 1; j++) 
            {
                if(i + k >= words.size()) 
                    tmp += " ";
                else 
                    tmp += string((L - l) / (k - 1) + (j < (L - l) % (k - 1)), ' ');
                tmp += words[i+j+1];
            }
            tmp += string(L - tmp.size(), ' ');
            res.push_back(tmp);
        }
        return res;
    }
};