Text Justification

最新推荐文章于 2024-03-15 13:24:07 发布

原创最新推荐文章于 2024-03-15 13:24:07 发布 · 370 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode题解同时被 2 个专栏收录

145 篇文章

订阅专栏

Greedy

2 篇文章

订阅专栏

本文介绍了一种用于文本左右对齐的算法实现方法，并详细解释了如何处理最后一行及单单词行的特殊情况。该算法适用于需要将文本按指定长度进行格式化的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

注意最后一行和只有一个word的行的特殊处理。

class Solution {
public:
    vector<string> fullJustify(vector<string> &words, int L) {
        vector<string> result;
        if(words.size() == 0) return result;
        
        int start = 0;
        int wordsLength = 0;
        for(int i=0; i<words.size(); i++)
        {
            if(wordsLength + words[i].size() + i-start > L)
            {
                string line = getLine(words, start, i-1, L, wordsLength, false);
                result.push_back(line);
                start = i;
                wordsLength = 0;
            }
            wordsLength += words[i].size();
        }
        string line = getLine(words, start, words.size()-1, L, wordsLength, true);
        result.push_back(line);
        return result;
    }
    
    string getLine(vector<string> &words, int begin, int end, int L, int wordsLength, bool lastLine)
    {
        string line;
        int count = end-begin+1;
        if(!lastLine && count > 1)
        {
            int spaceLength = L-wordsLength;
            int spaceEach = spaceLength/(count-1);
            int left = spaceLength%(count-1);
            for(int i=0; i<count; i++)
            {
                line += words[begin+i];
                if(i < left)
                    line.insert(line.end(), spaceEach+1, ' ');
                else if(i < count-1)
                    line.insert(line.end(), spaceEach, ' ');
            }
        }
        else
        {
            for(int i=0; i<count; i++)
            {
                line += words[begin+i];
                if(i<count-1)
                    line += " ";
                else
                    line.insert(line.end(), L-line.size(), ' ');
            }
        }
        return line;
    }
};