[LeetCode] 68. Text Justification

Karrdy 發布于2019-08-16 13:45 / 3236人閱讀

Problem

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                  "
]

Solution

class Solution {
    public List fullJustify(String[] words, int n) {
        List res = new ArrayList<>();
        if (words == null || words.length == 0) return res;
        for (String word: words) {
            if (word.length() > n) {
                throw new IllegalArgumentException("Invalid input.");
            }
        }
        
        int index = 0;
        while (index < words.length) {
            int len = words[index].length();
            int next = index+1;
            while (next < words.length) {
                if (len+1+words[next].length() > n) break;
                len += (1+words[next].length());
                next++;
            }
            StringBuilder sb = new StringBuilder();
            int count = next-1-index;
            
            //if reached last line, or still in same line of index
            if (next == words.length || count == 0) {
                for (int i = index; i < next; i++) {
                    sb.append(words[i]+" ");
                }
                //delete the last extra space
                sb.deleteCharAt(sb.length()-1);
                //fill the total length to n with white space
                for (int i = sb.length(); i < n; i++) {
                    sb.append(" ");
                }
            } else {
                int spaces = (n-len)/count;
                int remains = (n-len)%count;
                for (int i = index; i < next; i++) {
                    sb.append(words[i]);
                    if (i < next-1) {
                        for (int j = 0; j <= (spaces+((i-index) < remains ? 1 : 0)); j++) {
                            sb.append(" ");
                        }
                    }
                }
            }
            
            res.add(sb.toString());
            index = next;
        }
        
        
        return res;
    }
}

GPU云服務器云服務器 Justification LeetCode LeetCode_String js68

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://m.specialneedsforspecialkids.com/yun/72275.html

leetcode-68-Text Justification

68. Text JustificationDescriptionHintsSubmissionsDiscussSolutionGiven 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) justi...

remcarpediem 2019-07-30 15:43 評論0 收藏0
Leetcode PHP題解--D68 283. Move Zeroes

摘要：題目鏈接題目分析給定一個整數數組，將值為的元素移動到數組末尾，而不改動其他元素出現的順序。再在去后的元素末尾填充到計算出的數組長度。最終代碼若覺得本文章對你有用，歡迎用愛發電資助。 D68 283. Move Zeroes 題目鏈接 283. Move Zeroes 題目分析給定一個整數數組，將值為0的元素移動到數組末尾，而不改動其他元素出現的順序。思路計算總共有多少個元素。再...

xiongzenghui 2019-07-01 12:48 評論0 收藏0
13. 羅馬數字轉整數-----leetcode刷題（python解題）

摘要：題目羅馬數字包含以下七種字符，，，，，和。字符數值例如，羅馬數字寫做，即為兩個并列的。通常情況下，羅馬數字中小的數字在大的數字的右邊。同樣地，數字表示為。給定一個羅馬數字，將其轉換成整數。 [TOC] 題目羅馬數字包含以下七種字符: I， V， X， L，C，D 和 M。字符數值 I 1 V 5 X ...

Gu_Yan 2019-07-31 10:38 評論0 收藏0
8.leetcode Self Dividing Numbers

摘要：題目例子我的解法其他解法這個方法不用轉化成字符串，直接得到的數再除 1. 題目 A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 ...

付永剛 2019-08-23 16:54 評論0 收藏0
6leetcode機器移動

1 題目 There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves. The move sequence is re...

glumes 2019-08-23 16:42 評論0 收藏0