您当前位置：首页 > php开源 > php教程 > Leetcode 68 Text Justification

Leetcode 68 Text Justification

来源：程序员人生发布时间：2016-11-16 08:11:12 阅读次数：2339次

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.

大摹拟，写了很冗杂的代码，wa了无数次终究过了，后来看到了简介的版本，对侧重写了1份，详见注释！

class Solution { public: vector<string> fullJustify(vector<string>& words, int maxWidth) { vector<string> result; for(int i=0,k,l;i<words.size();i+=k) { for(k=l=0;i+k<words.size() && l+words[i+k].size()<=maxWidth-k;k++) l+=words[i+k].size(); //找出1行单词的个数k和总字母数l string temp=words[i]; //将第1个单词放入 for(int j=0;j<k⑴;j++) { if(i+k>=words.size()) //如果是最后1行 temp+=' '; else temp+=string((maxWidth-l)/(k⑴)+(j<(maxWidth-l)%(k⑴)),' ');//精华：单词之间的空格 temp+=words[i+j+1]; } temp+=string(maxWidth-temp.size(),' ');//补全空格 result.push_back(temp); } return result; } };

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 Hibernate实战数据持久化之二hibernate简单的入门实例

下一篇 Android设计模式系列-组合模式

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点