LeetCode #68 - 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.  "

]

Example 2:

Input:

words = ["What","must","be","acknowledgment","shall","be"]

maxWidth = 16

Output:

[

  "What   must   be",

  "acknowledgment  ",

  "shall be        "

]

Explanation: Note that the last line is "shall be    " instead of "shall     be", because the last line must be left-justified instead of fully-justified. Note that the second line is also left-justified becase it contains only one word.

Example 3:

Input:

words = [“Science","is","what","we","understand","well","enough","to","explain",

"to","a","computer.","Art","is","everything","else","we","do"]

maxWidth = 20

Output:

[

  "Science  is  what we",

  "understand      well",

  "enough to explain to",

  "a  computer.  Art is",

  "everything  else  we",

  "do                  "

]

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> result;
        int i=0;
        int j=0;
        while(j<words.size())
        {
            int len=0;
            //当加入j符合要求时进入循环，所以在循环结束时j必定超出当前行，也就是下一行的第一个单词
            while(j<words.size()&&(len+j-i+words[j].size())<=maxWidth)
            {
                len+=words[j].size();
                j++;
            }
            
            string s; //s的单词范围是words[i]~words[j-1]
            if(j==words.size()) //最后一行
            {
                s+=words[i];
                for(int k=i+1;k<j;k++) s+=" "+words[k];
                while(s.size()<maxWidth) s+=" ";
            }
            else
            {
                int space=maxWidth-len;
                int space_count=j-i-1;
                if(space_count==0)
                { //当一个单词单独占一行时，没有中间空格，需要单独判断
                    s+=words[i];
                    while(s.size()<maxWidth) s+=" ";      
                }
                else
                {
                    string a(space/space_count+1,' '); //较长的空格字符串
                    string b(space/space_count,' '); //较短的空格字符串
                    int count_a=space-b.size()*space_count;
                    int count_b=space_count-count_a;
                    s+=words[i];
                    int k=i+1;
                    while(count_a>0)
                    {
                        s+=a+words[k];
                        k++;
                        count_a--;
                    }
                    while(count_b>0)
                    {
                        s+=b+words[k];
                        k++;
                        count_b--;
                    }
                }
            }
            result.push_back(s);
            i=j;
        }
        return result;
    }
};