Leetcode - Text Justification

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.

[分析] 该题算法本身不复杂,考察的是对边界条件的处理。题意把握上主要两点:1)当某行只能放下一个单词时,空格全部放在右边 2)最后一行单词间仅有一个空格,多余空格均放在右边。详细分析参考[url]http://blog.youkuaiyun.com/linhuanmars/article/details/24063271[/url]



public class Solution {
public List<String> fullJustify(String[] words, int maxWidth) {
List<String> result = new ArrayList<String>();
if (words == null || words.length == 0 || maxWidth < 0)
return result;
int count = 0, last = 0;
for (int i = 0; i < words.length; i++) {
if (count + words[i].length() + (i - last) > maxWidth) {
int extraNum = 0, spaceNum = 0;
if (i - 1 > last) {
spaceNum = (maxWidth - count) / (i - 1 - last);
extraNum = (maxWidth - count) % (i - 1 - last);
}
StringBuilder avgSpaces = new StringBuilder();
while (spaceNum > 0) {
avgSpaces.append(" ");
spaceNum--;
}
StringBuilder row = new StringBuilder();
for (int j = last; j < i - 1; j++) {
row.append(words[j]);
row.append(avgSpaces.toString());
if (extraNum > 0) {
row.append(" ");
extraNum--;
}
}
row.append(words[i - 1]);
for (int j = row.length(); j < maxWidth; j++) {
row.append(" ");
}
result.add(row.toString());
count = 0;
last = i;
}
count += words[i].length();
}
// deal with the last row which sometimes not processed int the above loop
StringBuilder row = new StringBuilder();
for (int i = last; i < words.length; i++) {
row.append(words[i]);
if (row.length() < maxWidth)
row.append(" ");
}
while (row.length() < maxWidth)
row.append(" ");
result.add(row.toString());
return result;
}
}
内容概要:本文档为VMware虚拟机的安装提供了详细的指导。首先明确了安装前计算机应满足的条件,包括操作系统、处理器、内存和硬盘空间的要求。接着介绍了从VMware官网下载Workstation Player的步骤,它是适用于个人用户的免费虚拟机软件。文档详细列出了安装Workstation Player的具体操作流程,包括安装向导指引、许可协议接受以及安装路径的选择。然后重点讲解了创建新虚拟机的步骤,涵盖虚拟机类型的选取、操作系统镜像文件的选择、资源配置及网络设置等。此外,还阐述了操作系统在虚拟机中的安装方法,以及安装后VMware Tools的配置以提升性能和兼容性。最后针对可能出现的问题给出了常见解决方案,如虚拟化技术未开启、虚拟机无法启动和性能问题等,确保用户能顺利完成虚拟机的安装与配置。; 适合人群:对虚拟机有需求但缺乏安装经验的个人用户,尤其是想要进行多操作系统环境下的开发、测试工作的技术人员。; 使用场景及目标:①帮助用户在本地计算机上搭建不同操作系统的运行环境;②为开发、测试等工作提供便捷的虚拟化平台;③解决安装过程中可能遇到的各种问题,确保虚拟机稳定运行。; 其他说明:本教程为简化版本,实际操作时可根据自身情况调整相关设置。若遇困难,可参考官方文档或寻求专业帮助。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值