LeetCode 68. Text Justification
来源:互联网 发布:皇冠淘宝店铺收入 编辑:程序博客网 时间:2024/06/05 18:44
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.
这个题确实没读懂 看了code ganker的博客才搞懂。。
public class Solution { public List<String> fullJustify(String[] words, int L) { List<String> res = new ArrayList<String>(); if(words==null || words.length==0) return res; int count = 0; int last = 0; for(int i=0;i<words.length;i++) { if(count+words[i].length()+(i-last)>L) { int spaceNum = 0; int extraNum = 0; if(i-last-1>0) { spaceNum = (L-count)/(i-last-1); extraNum = (L-count)%(i-last-1); } StringBuilder str = new StringBuilder(); for(int j=last;j<i;j++) { str.append(words[j]); if(j<i-1) { for(int k=0;k<spaceNum;k++) { str.append(" "); } if(extraNum>0) { str.append(" "); } extraNum--; } } for(int j=str.length();j<L;j++) { str.append(" "); } res.add(str.toString()); count=0; last=i; } count += words[i].length(); } StringBuilder str = new StringBuilder(); for(int i=last;i<words.length;i++) { str.append(words[i]); if(str.length()<L) str.append(" "); } for(int i=str.length();i<L;i++) { str.append(" "); } res.add(str.toString()); return res; }}
- LeetCode 68. Text Justification
- LeetCode --- 68. Text Justification
- [Leetcode] 68. Text Justification
- [leetcode] 68.Text Justification
- [leetcode] 68. Text Justification
- LeetCode 68. Text Justification
- Leetcode 68. Text Justification
- LeetCode 68. Text Justification
- leetcode 68. Text Justification
- [LeetCode] 68. Text Justification
- LeetCode-68.Text Justification
- leetcode 68. Text Justification
- leetcode-68. Text Justification
- Leetcode 68. Text Justification
- [LeetCode] 68. Text Justification
- 【LeetCode】68. Text Justification
- Leetcode 68. Text Justification
- Leetcode 68. Text Justification
- JAVA版List<Map>排序,按字符或数字类型排序,支持正序倒序
- USACO-Section2.1 Sorting a Three-Valued Sequence【数学公式】
- 华为OJ——学英语
- 总结TCP协议中的定时器
- mysql 索引
- LeetCode 68. Text Justification
- html的列表标签和表单
- HDU-1050 走廊搬桌子
- Mac 下配置环境变量(Mysql为例)
- 滴滴开源Android插件化框架VirtualAPK原理分析
- ADO接口操作数据库.
- 按键检测
- css控制border画三角形
- Js中__proto__和prototype的区别和关系