国产xxxx99真实实拍_久久不雅视频_高清韩国a级特黄毛片_嗯老师别我我受不了了小说

資訊專欄INFORMATION COLUMN

[LeetCode] 68. Text Justification

Karrdy / 3228人閱讀

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;
    }
}

文章版權(quán)歸作者所有,未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為,您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請(qǐng)注明本文地址:http://specialneedsforspecialkids.com/yun/72275.html

相關(guān)文章

  • 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 評(píng)論0 收藏0
  • Leetcode PHP題解--D68 283. Move Zeroes

    摘要:題目鏈接題目分析給定一個(gè)整數(shù)數(shù)組,將值為的元素移動(dòng)到數(shù)組末尾,而不改動(dòng)其他元素出現(xiàn)的順序。再在去后的元素末尾填充到計(jì)算出的數(shù)組長(zhǎng)度。最終代碼若覺得本文章對(duì)你有用,歡迎用愛發(fā)電資助。 D68 283. Move Zeroes 題目鏈接 283. Move Zeroes 題目分析 給定一個(gè)整數(shù)數(shù)組,將值為0的元素移動(dòng)到數(shù)組末尾,而不改動(dòng)其他元素出現(xiàn)的順序。 思路 計(jì)算總共有多少個(gè)元素。 再...

    xiongzenghui 評(píng)論0 收藏0
  • 13. 羅馬數(shù)字轉(zhuǎn)整數(shù)-----leetcode刷題(python解題)

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

    Gu_Yan 評(píng)論0 收藏0
  • 8.leetcode Self Dividing Numbers

    摘要:題目例子我的解法其他解法這個(gè)方法不用轉(zhuǎn)化成字符串,直接得到的數(shù)再除 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 ...

    付永剛 評(píng)論0 收藏0
  • 6leetcode機(jī)器移動(dòng)

    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 評(píng)論0 收藏0

發(fā)表評(píng)論

0條評(píng)論

最新活動(dòng)
閱讀需要支付1元查看
<