[leetcode-68]Text Justification(java)
来源:互联网 发布:java数组和链表的区别 编辑:程序博客网 时间:2024/06/11 02:38
问题描述:
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.
分析:这道题可能就是细节稍微多一点,其他的都还好。
代码如下:332ms
public class Solution { public List<String> fullJustify(String[] words, int maxWidth) { List<String> res = new LinkedList<>(); List<String> tmpList = new LinkedList<>(); int length = words.length; int count = 0; for(int i = 0;i<length;i++){ count+=words[i].length()+1; tmpList.add(words[i]); if(i+1<length && count+words[i+1].length()>maxWidth){ int neededSpace = maxWidth-count+1; int size = tmpList.size(); int average,extra; if(size==1) { average = neededSpace; extra = 0; } else{ average =neededSpace/(size-1); extra = neededSpace%(size-1); } StringBuilder spaceStr = new StringBuilder(); for(int j = 0;j<average;j++) spaceStr.append(' '); StringBuilder builder = new StringBuilder(); while(!tmpList.isEmpty()) { String tmp = tmpList.get(0); tmpList.remove(0); builder.append(tmp); if (tmpList.isEmpty()) break; builder.append(' '); builder.append(spaceStr); if (extra > 0) { builder.append(' '); extra--; } } while(builder.length()<maxWidth){ builder.append(' '); } res.add(new String(builder)); count=0; } } StringBuilder builder = new StringBuilder(); while(!tmpList.isEmpty()){ builder.append(tmpList.get(0)); tmpList.remove(0); builder.append(' '); } while (builder.length()<maxWidth) builder.append(' '); if(builder.length()>maxWidth) builder.deleteCharAt(maxWidth); res.add(builder.toString()); return res; }}
- [leetcode-68]Text Justification(java)
- [Leetcode] Text Justification (Java)
- [LeetCode][Java] 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)LeetCode-68. Text Justification
- [Leetcode 68, Hard] Text Justification
- LeetCode(68) Text Justification
- leetcode 68:Text Justification细致分析,java实现
- [leetcode]68. Text Justification@Java解题报告
- final....
- OpenStack Ceilometer 简介
- the import javax.serlet cannot be solved.和Httpservlet cannot be resolved to a type
- Unix世界的三个标准
- 人工智能不会毁灭人类:机器更依赖人
- [leetcode-68]Text Justification(java)
- 在Windows的Tomcat环境下部署Solr 4.7.0
- 字符串转整数
- 计划策略-10-净需求计划
- C语言undefined behaviour未定义行为
- 随笔,在工作中遇到的问题(杂)
- 关于switch语句的一点介绍
- C++学习笔记
- 计划策略-11-毛需求计划