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.

click to show corner cases.

Corner Cases:

• A line other than the last line might contain only one word. What should you do in this case?
  In this case, that line should be left-justified.

这道题有点像airbnb的oa题目，分页的题，只是这题是分行，需要注意很多细节。

首先想到什么条件下是需要分行的，就是当前行的单词长度 + 每两个单词中间空一行 + 下一个单词 > maxWidth的时候，所以需要变量count记录当前有多少个单词，那么空格数就是count-1， 需要widthLen记录当前行所有单词的长度和。当不够一行的时候就不断循环增加count和wordLen，当放不下一行是开始构建当前行并加入到返回vector res里。

构建当前行row时，需要计算每两个单词中间放多少个空格，用space = （maxWidth - wordLen）/ （count - 1）就是每两个单词中间应放的空格数，但是这个时候要想到可能空格数不是能整除的，题目说明了为了更加even要平均地把多余空格按照从左到右的顺序依次放入，所以多计算一个变量extraSpace = （maxWidth - wordLen）% （count - 1）。

还有一个细节就是当一行只能放进一个word时，要左对齐，空格都放在右面，要单独处理。

最后一行也要单独处理：1一个单词，2多个单词。

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> res;
        int count = 0;
        int wordLen = 0;
        int line = 0;
        int i = 0;
        int start = 0;
        while (i < words.size()) {
            //cout << words[i]<<endl;
            wordLen += words[i].size();
            count++;
            line = count - 1 + wordLen;
            if (line <= maxWidth) {
                i++;
            }
            else {
                count--;
                wordLen -= words[i].size();
                //cout << count << endl;
                //cout << wordLen << endl;
                string row = "";
                if (count == 1) {
                    row += words[start];
                    int space = maxWidth - words[start].size();
                    while (space > 0) {
                        row += ' ';
                        space--;
                    } 
                    //cout << row << endl;
                    res.push_back(row);
                }
                else {
                    //cout << "========="<<endl;
                    int space = (maxWidth - wordLen) / (count - 1);
                    //cout<< space << endl;
                    int extraSpace = (maxWidth - wordLen) % (count - 1);
                    //cout << extraSpace << endl;
                    while (count > 1) {//注意这个地方是>1不是0，因为最后一个后面不用加空格，跳出循环单独添加
                        row += words[start++];
                        int j = 0;
                        while (j < space) {
                            row += ' ';
                            j++;//注意更新循环变量
                        }
                        if (extraSpace > 0) {
                            row += ' ';
                            extraSpace--;
                        }
                       
                        count--;
                    }
                    row += words[start];
                    res.push_back(row);
                }
                count = 0;//更新count不然count = 1 时并不会减到0
                wordLen = 0;
                start = i;
             }
        }
        //last line
        string row = "";
        
        if (count == 1) {
            row += words[start];
            int space = maxWidth - words[start].size();
            while (space > 0) {
                row += ' ';
                space--;
            } 
            res.push_back(row);
        }
        else {
            while (count > 1) {//注意这个地方是>1不是0，因为最后一个后面不用加空格，跳出循环单独添加
                row += words[start++];
                row += ' ';
                count--;
            }
            if (line == maxWidth) row += words[start];
            else {
                row += words[start];
                int space = maxWidth - line;
                while (space > 0) {
                    row += ' ';
                    space--;
                }
            }
            res.push_back(row);
        }
        return res;
    }
};

细节：

1 注意如何处理每行的末尾，末尾单词后面不用加空格

2 while如何循环，避免死循环，记得更新循环变量

3