leetcode 68 Text Justification

一 题目

 Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth 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 maxWidth 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.

Note:

• A word is defined as a character sequence consisting of non-space characters only.
• Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
• The input array words contains at least one word.

Example 1:

Input:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
Output:
[
   "This    is    an",
   "example  of text",
   "justification.  "
]

Example 2:

Input:
words = ["What","must","be","acknowledgment","shall","be"]
maxWidth = 16
Output:
[
  "What   must   be",
  "acknowledgment  ",
  "shall be        "
]
Explanation: Note that the last line is "shall be    " instead of "shall     be",
             because the last line must be left-justified instead of fully-justified.
             Note that the second line is also left-justified becase it contains only one word.

Example 3:

Input:
words = ["Science","is","what","we","understand","well","enough","to","explain",
         "to","a","computer.","Art","is","everything","else","we","do"]
maxWidth = 20
Output:
[
  "Science  is  what we",
  "understand      well",
  "enough to explain to",
  "a  computer.  Art is",
  "everything  else  we",
  "do                  "
]

二 分析

   hard级别，不是要有什么专门算法，而是题目本身限制很多葛铮对齐限制。就是字符串的操作。我做了一晚上没搞定，看了下网上的解题，整理下。因为返回结果是多行的，所以还是要一行行的处理，分为不同情况：

• 1 一行只有一个单词。maxWidth抛去单词长度，剩下填充空格。
• 2.最后一行：单词间隔1个空格，末尾再用空格补足长度。
• 3.多个单词情况：先确定每一行能放下的单词数（比较n个单词的长度和加上n - 1个空格的长度跟给定的长度maxWidth），找到了一行能放下的单词个数，然后计算出这一行存在的空格的个数（maxWidth-行单词的长度和），这些空格数也要按照规则分配：基本空格数之外，还有多余出一部分空格，那么就在附加空格的时候，从左边开始每次多加一个，满足题目的左边的空格大于等于右边的1个。

基本上参照了grandyang大神写的，他是c++.代码更简洁。我的太乱了。算法珠玑的这一篇写的也很清晰：

https://soulmachine.gitbooks.io/algorithm-essentials/java/simulation/text-justification.html

public static void main(String[] args) {
		// TODO Auto-generated method stub
		String[] word = {"What","must","be","acknowledgment","shall","be"};
		List<String> res = fullJustify(word,16);
		System.out.println( JSON.toJSON(res));
	}
	
	 public static List<String> fullJustify(String[] words, int maxWidth) {
		 
		List<String> res = new ArrayList();
		//conner case
		 if(words==null || words.length==0){
		        return res;
		}
	
		    for(int i=0; i<words.length; ){
		    	 StringBuilder sb = new StringBuilder();
		    	int j=i,len = 0;
		    	//尝试寻找最大长度
		    	while (j < words.length && len + words[j].length() + j - i <= maxWidth) {
	                len += words[j++].length();	           
	            }
		    	//最后一行
		    	if(j == words.length){
		    		for(int k=i;k<words.length;k++){
		    			sb.append(words[k]+" ");
		    		}
		    		sb.deleteCharAt(sb.length()-1);
		    		//补充空格
		    		for(int k= sb.length(); k<maxWidth;k++ ){
		    			sb.append(" ");
		    		}
		    	
		    	}else if(j-i==1){
		    		// 只有1个word
		    		sb.append(words[i]);
		    		//拼空格
		    		for(int k =words[i].length(); k<maxWidth;k++){
		    			sb.append(" ");
		    		}
		 
		    	}else {
		    		//多个单词
		    		int wordNum = j-i;
		    		int wordTotal =0;
		    		for(int k=i;k< j;k++){
		    			wordTotal += words[k].length();
		    		}
		    		//基本空格数
		    		int space =  (maxWidth - wordTotal) / (wordNum - 1);
		    		//剩余空格数：从左往右，前面空格数space+1
		    		 int r = (maxWidth - wordTotal) % (wordNum - 1);
		    		 for(int k= i;k < j;k++){
						sb.append(words[k]);
						if (k < j - 1) {
							for (int l = 0; l < space; l++)
								sb.append(" ");
							if (r-- > 0)
								sb.append(" ");
						}
		    		 }
		    		 
		    	}
		    	 
		    	res.add(sb.toString());
		    	i=j;
		    }
		 
		 
		return res;
	        
	 }

Runtime: 0 ms, faster than 100.00% of Java online submissions for Text Justification.

Memory Usage: 34.9 MB, less than 97.22% of Java online submissions for Text Justification.

参考

https://www.cnblogs.com/grandyang/p/4350381.html