Posts Tagged 【String】 Text Justification

Text Justification

 Total Accepted: 18124 Total Submissions: 125685My Submissions

Question Solution 

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 exactlyL 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.

/*这种题目，没有什么算法就是，try-fail 各种test其实还是没看懂题目的赶脚，so look belowInput:["Listen","to","many,","speak","to","a","few."], 6Output:["Listen","to","many,","speak","to   a","few.  "]Expected:["Listen","to    ","many, ","speak ","to   a","few.  "]*/public class Solution {    public List<String> fullJustify(String[] words, int maxWidth) {    //maxWidth >= words[i].length        int lenWords = words.length;        List<String> list = new ArrayList<String>();        if(words.length == 1 && words[0].isEmpty()) {            StringBuilder sb = new StringBuilder();            for(int i = 0;i<maxWidth;i++)                sb.append(" ");            sb.append("");               list.add(sb.toString());            return list;        }        for(int item = 0;item<lenWords;) {            int lenStr = 0;            StringBuilder sb = new StringBuilder();            int start = item,end = 0;            while(item<lenWords && lenStr < maxWidth) {                lenStr += words[item].length()+1;                if(lenStr > maxWidth+1) {                lenStr -= words[item].length()+1;                break;                }                item++;            }            end = item - 1;            int len = 0,lenRemainder = 0;            if(end != start) {            len = (maxWidth-lenStr+1)/(end-start);            lenRemainder = (maxWidth-lenStr+1)%(end-start);                        }            if(end == words.length - 1) {                for(int j = start;j<end;j++)                 sb.append(words[j]+" ");                sb.append(words[end]);            } else {                for(int j = start;j<end;j++) {                sb.append(words[j]+" ");                for(int i = 0;i<len;i++) {                sb.append(' ');                }                if(lenRemainder-- > 0) {                sb.append(' ');                }                }                sb.append(words[end]);            }            int lenSb = sb.length();            while(lenSb++ < maxWidth)                 sb.append(' ');            list.add(sb.toString());        }        return list;    }}

Have you met this question in a real interview?