题目
leetcode 68
给定一个单词数组和一个长度 maxWidth,重新排版单词,使其成为每行恰好有 maxWidth 个字符,且左右两端对齐的文本。
你应该使用“贪心算法”来放置给定的单词;也就是说,尽可能多地往每行中放置单词。必要时可用空格 ’ ’ 填充,使得每行恰好有 maxWidth 个字符。
要求尽可能均匀分配单词间的空格数量。如果某一行单词间的空格不能均匀分配,则左侧放置的空格数要多于右侧的空格数。
文本的最后一行应为左对齐,且单词之间不插入额外的空格。
说明:
单词是指由非空格字符组成的字符序列。
每个单词的长度大于 0,小于等于 maxWidth。
输入单词数组 words 至少包含一个单词。
示例:
输入:
words = [“This”, “is”, “an”, “example”, “of”, “text”, “justification.”]
maxWidth = 16
输出:
[
“This is an”,
“example of text”,
"justification. "
]
示例 2:
输入:
words = [“What”,“must”,“be”,“acknowledgment”,“shall”,“be”]
maxWidth = 16
输出:
[
“What must be”,
"acknowledgment ",
"shall be "
]
解释: 注意最后一行的格式应为 "shall be " 而不是 “shall be”,
因为最后一行应为左对齐,而不是左右两端对齐。
第二行同样为左对齐,这是因为这行只包含一个单词。
示例 3:
输入:
words = [“Science”,“is”,“what”,“we”,“understand”,“well”,“enough”,“to”,“explain”,
“to”,“a”,“computer.”,“Art”,“is”,“everything”,“else”,“we”,“do”]
maxWidth = 20
输出:
[
“Science is what we”,
“understand well”,
“enough to explain to”,
“a computer. Art is”,
“everything else we”,
"do "
]
代码
此题没什么技巧,就是细节。
1.空间应该开maxWidth + 1;
2.如果空格不能平均分配,应该左边空格数多余右边,并且左边也是均匀分配的
char ** fullJustify(char ** words, int wordsSize, int maxWidth, int* returnSize){
*returnSize = 0;
char **res = (char **)malloc(sizeof(char *) * wordsSize);
//每一行单词数;每行单词的总长度;空格数;words单词的起始位置
int words_c = 0, words_len = 0, blank = 0, k = 0, check_len = 0, rescol = 0, flag = 0;
int i;
for (i = 0; i < wordsSize; i++) {
int wlen = strlen(words[i]);
check_len = words_len + words_c + wlen;
if (check_len >= maxWidth) {
if (check_len == maxWidth) {
words_c++;
words_len += wlen;
} else {
i--;
}
if (i == wordsSize - 1) break;
if (words_c == 1) {blank = maxWidth - words_len; flag = 0;}
else {
blank = (maxWidth - words_len) / (words_c - 1);
flag = (maxWidth - words_len) % (words_c - 1);
}
res[*returnSize] = (char *)malloc(sizeof(char) * (maxWidth + 1));
for (int j = k; j <= i; j++) {
int m = 0;
while (words[j][m] != '\0') {
res[*returnSize][rescol++] = words[j][m++];
}
m = 0;
while (rescol < maxWidth && m < blank) {res[*returnSize][rescol++] = ' '; m++;}
if (flag > 0) {res[*returnSize][rescol++] = ' '; flag--;}
}
res[*returnSize][maxWidth] = '\0';
(*returnSize)++;
words_c = 0;
words_len = 0;
k = i + 1;
check_len = 0;
rescol = 0;
} else {
words_c++;
words_len += wlen;
}
}
res[*returnSize] = (char *)malloc(sizeof(char) * (maxWidth + 1));
while (words_c > 0) {
int m = 0;
while (words[k][m] != '\0') res[*returnSize][rescol++] = words[k][m++];
res[*returnSize][rescol++] = ' ';
k++;
words_c--;
}
while (rescol < maxWidth) res[*returnSize][rescol++] = ' ';
res[*returnSize][maxWidth] = '\0';
(*returnSize)++;
return res;
}