Text Justification

最新推荐文章于 2021-09-09 01:27:41 发布

brucehb

最新推荐文章于 2021-09-09 01:27:41 发布

阅读量492

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/brucehb/article/details/46643531

版权

算法专栏收录该内容

636 篇文章 2 订阅

订阅专栏

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.

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> result;
        int n = words.size();

        int left = 0;
        int right = 0;
        int num = 0;
        int len = 0;
        for (int i = 0; i < n;)
        {
            if (num == 0)
            {
                left = i;
                right = i;
                num = 1;
                len = words[i].length();
                if (i == n-1)
                {
                    break;
                }
                i++;
            }
            else
            {
                if (len+num+words[i].length() <= maxWidth)
                {
                    right = i;
                    num += 1;
                    len += words[i].length();
                    if (i == n-1)
                    {
                        break;
                    }
                    i++;
                }
                else
                {
                    string temp;
                    int spaceNum = maxWidth-len;
                    if (num == 1)
                    {
                        string pad(spaceNum, ' ');
                        temp = words[left] + pad;
                    }
                    else
                    {
                        int everySpaceNum = spaceNum/(num-1);
                        int firstSpaceNum = spaceNum - (num-2)*everySpaceNum;
                        string everyPad(everySpaceNum, ' ');
                        int offset = firstSpaceNum - everySpaceNum;
                        if (offset > 0)
                        {
                            string pad(everySpaceNum+1, ' ');
                            for (int i = 0; i < offset; i++)
                            {
                                temp += words[left+i] + pad;
                            }
                        }
                    
                        for (int i = left+offset; i < right; i++)
                        {
                            temp += words[i] + everyPad;
                        }
                        temp += words[right];
                    }

                    result.push_back(temp);
                    num = 0;
                }
            }
        }

        if (num > 0)
        {
            string temp;
            if (num == 1)
            {
                string pad(maxWidth-len, ' ');
                temp = words[left] + pad;
            }
            else
            {
                for (int i = left; i < right; i++)
                {
                    temp += words[i] + ' ';
                }
                temp += words[right];
                int totalLen = len + num - 1;
                if (maxWidth > totalLen)
                {
                    string pad(maxWidth-totalLen, ' ');
                    temp += pad;
                }
            }

            result.push_back(temp);
        }

        return result;
    }
};