Leetcode 68. Text Justification

最新推荐文章于 2022-04-13 22:54:59 发布

木车

最新推荐文章于 2022-04-13 22:54:59 发布

阅读量205

点赞数

分类专栏： Leetcode C++ 文章标签： C Leetcode

本文链接：https://blog.csdn.net/muche001/article/details/79217303

版权

Leetcode C++ 专栏收录该内容

241 篇文章 0 订阅

订阅专栏

原题：

Given an array of words and a length L, format the text such that each line has exactlyL 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.

解决方法：

有一定难度的一道题。没有很巧妙的解法，根据题目要求一步一步求解：

- 首先计算一行里面可以保存的单词数。

- 如果有多个单词，单词之间将加入多个空格，对前面的单词，可能需要多加一个空格。

- 最后一行，单词之间只有一个空格。

- 如果单词加入后，长度不够，全部补上空格。

代码：

vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> res;
        int n = words.size(), count = 0, target = 0;
        
        for(int i = 0; i < n; i+= count){            
            for(count = 0, target = 0; (i+count)< n && ( target + words[i+count].size()<=(maxWidth-count) );++count)
                target += words[i+count].size();
                        
            string line = words[i];
            int avg = (count > 1) ? (maxWidth-target)/(count-1) : 0;
            int remain  = (count > 1) ? (maxWidth-target)%(count-1) : 0;
            for(int j = 0; j < count -1;j++){
                if (i+count >= n){
                    line += ' ';
                }else{
                    line += string(avg + ((j < remain) ? 1 : 0) , ' ');
                }
                line +=  words[i+j+1];
            }
            
            line += string(maxWidth - line.size(), ' ');
            res.push_back(line);
        }
        
        return res;
    }