Leetcode(68) Text Justification

发表于 | 分类于

Description

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:

1
2
3
4
5
6
7
8
9
Input:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
Output:
[
   "This    is    an",
   "example  of text",
   "justification.  "
]

Example 2:

1
2
3
4
5
6
7
8
9
10
11
12
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:

1
2
3
4
5
6
7
8
9
10
11
12
13
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                  "
]

解法

又是一道挺麻烦的题，其实我觉得根贪心算法关系不大。按行处理，先计算每行的单词数，再得出正常情况（按一个空格分隔单词）的空格数，再用最大值减去当前（含空格）的字符个数，分配这个数目的空格到各个间隙中去。

具体代码如下：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
class Solution {
    public List<String> fullJustify(String[] words, int maxWidth) {
        List<String> tmp = new ArrayList<>();
        List<String> res = new ArrayList<>();
        List<Integer> blankcount = new ArrayList<>();
        int lofline = 0;
        for (int k = 0; k < words.length; k++) {
            String s = words[k];
            if (lofline == 0) {
                lofline += s.length();
                tmp.add(s);
            } else {
                lofline += s.length();
                lofline += 1;
                tmp.add(s);
            }
            if (lofline > maxWidth) {
                lofline -= tmp.get(tmp.size() - 1).length();
                lofline -= 1;
                tmp.remove(tmp.size() - 1);
                k--;
                int extrablankespace = maxWidth - lofline;
                int blanknum = tmp.size() - 1;
                if (blanknum == 0) {
                    blankcount.add(extrablankespace);
                } else {
                    for (int j = 0; j < blanknum; j++) {
                        blankcount.add(1);
                    }
                    while (extrablankespace != 0) {
                        for (int i = 0; i < blanknum; i++) {
                            blankcount.set(i, blankcount.get(i) + 1);
                            extrablankespace--;
                            if (extrablankespace == 0) {
                                break;
                            }
                        }
                    }
                }
                StringBuffer sb = new StringBuffer();
                while (tmp.size() != 0) {
                    sb.append(tmp.get(0));
                    if (blankcount.size() != 0) {
                        for (int i = 0; i < blankcount.get(0); i++) {
                            sb.append(" ");
                        }
                        blankcount.remove(0);
                    }
                    tmp.remove(0);
                }
                res.add(sb.toString());
                lofline = 0;
            } else if (maxWidth == lofline) {
                StringBuffer sb = new StringBuffer();
                while (tmp.size() != 0) {
                    sb.append(tmp.get(0));
                    tmp.remove(0);
                    if (tmp.size() != 0) {
                        sb.append(" ");
                    }
                }
                res.add(sb.toString());
                lofline = 0;
            } else if (maxWidth > lofline && k == words.length - 1) {
                StringBuffer sb = new StringBuffer();
                while (tmp.size() != 0) {
                    sb.append(tmp.get(0));
                    tmp.remove(0);
                    if (tmp.size() != 0) {
                        sb.append(" ");
                    }
                }

                for (int i = 0; i < maxWidth - lofline; i++) {
                    sb.append(" ");
                }
                res.add(sb.toString());
                lofline = 0;
            }
        }
        return res;
    }
}