Repository navigation
Expand file tree
/
Copy pathtextJustification.cpp
More file actions
143 lines (125 loc) · 3.96 KB
/
Copy pathtextJustification.cpp
File metadata and controls
143 lines (125 loc) · 3.96 KB
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
// Source : https://oj.leetcode.com/problems/text-justification/
// Author : Hao Chen
// Date : 2014-10-11
/**********************************************************************************
*
* Given 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) 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 L 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.
*
* For example,
* words: ["This", "is", "an", "example", "of", "text", "justification."]
* L: 16.
*
* Return the formatted lines as:
*
* [
* "This is an",
* "example of text",
* "justification. "
* ]
*
* Note: Each word is guaranteed not to exceed L in length.
*
*
* Corner Cases:
*
* A line other than the last line might contain only one word. What should you do in this case?
* In this case, that line should be left-justified.
*
*
**********************************************************************************/
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<string> fullJustify(vector<string> &words, int L) {
vector<string> result;
int len=0;
int start = 0;
int end = 0;
double space =0;
bool lastLine = false;
for (int i=0; i<words.size(); i++){
len += words[i].size();
if (len + i - start > L || i == words.size()-1) {
//remove the last one
if (len + i - start > L) {
len -= words[i].size();
end = i-1;
lastLine = false;
}else{
end = i;
lastLine = true;
}
//calculate the space number
space = L - len;
int mspace;
int extra;
if (lastLine){
mspace = 1;
extra = 0;
} else {
mspace = floor(space/(end-start));
extra = space - mspace * (end-start);
}
string line = words[start];
for (int j=start+1; j<=end; j++) {
for(int k=0; k<mspace && space>0; k++, space--) {
line += " ";
}
if (j-start-1 < extra){
line += " ";
space--;
}
line += words[j];
}
//add the rest space
if (space>0){
for(; space>0; space--) {
line += " ";
}
}
result.push_back(line);
start = i;
i = end;
len = 0;
}
}
return result;
}
void printVector(vector<string> &words, bool newline=false) {
for(int i=0; i<words.size(); i++) {
cout << "\"" << words[i] << "\", ";
if (newline) cout << endl;
}
cout << endl;
}
void test(const char* A[], int len, int L) {
vector<string> words(A, A+len);
printVector(words);
vector<string> result = fullJustify(words, L);
cout << endl;
printVector(result, true);
}
#define TEST(a, L) test(a, sizeof(a)/sizeof(const char*), L)
int main(int argc, char** argv)
{
const char* w1[]={"This", "is", "an", "example", "of", "text", "justification."};
TEST(w1, 16);
const char* w2[] = {"What","must","be","shall","be."};
TEST(w2, 12);
const char* w3[] = {"My","momma","always","said,","Life","was","like","a","box","of","chocolates.","You","never","know","what","you're","gonna","get."};
TEST(w3, 20);
return 0;
}