Text Justification

最新推荐文章于 2024-03-15 13:24:07 发布

最新推荐文章于 2024-03-15 13:24:07 发布 · 62 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一个用于文本格式化的算法，该算法能够确保每行文本恰好包含指定数量的字符，并实现左右两端对齐的效果。通过贪婪策略填充尽可能多的单词到一行中，在必要时插入额外的空格以达到每行所需的长度。

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.

public class Solution {
	public ArrayList<String> fullJustify(String[] words, int L) {
		ArrayList<String> res = new ArrayList<String>();
	    int last = 0;
	    int count = 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;
	}
}