[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;    }}
0 0
原创粉丝点击