Leetcode/justifyText.cpp at main · ChongXern/Leetcode · GitHub

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
/**
 * https://leetcode.com/problems/text-justification/
 * Array, String, Simulation
 * Hard
 */

#include <iostream>
#include <string>
#include <vector>
using namespace std;

class Solution {
public:
    vector<string> fullJustify(vector<string>& words, int maxWidth) {
        vector<string> output;
        vector<string> currWords;
        int currLetterCount = 0;
        int currWordsSize = 0;
        int countSpace;
        string line = "";
        for (int i = 0; i < words.size(); i++) {
            if (2 * currLetterCount + words[i].size() > maxWidth + 6) {
                cout << currLetterCount << endl;
                if (currWordsSize == 1) {
                    string space(maxWidth - currWords[0].size(), ' ');
                    line += currWords[0];
                    line += space;
                    output.push_back(line);
                    line = "";
                    currLetterCount = 0;
                    currWordsSize = 0;
                    currWords.clear();
                    countSpace = 0;
                    continue;
                }
                countSpace = (maxWidth - currLetterCount) / (currWordsSize - 1);
                string space(countSpace, ' ');
                for (int i = 0; i < currWordsSize - 1; i++) {
                    line += currWords[i];
                    line += space;
                }
                line += currWords[currWordsSize - 1];
                output.push_back(line);
                line = "";
                currLetterCount = 0;
                currWordsSize = 0;
                currWords.clear();
                countSpace = 0;
            }
            currLetterCount += words[i].size();
            currWords.push_back(words[i]);
            currWordsSize++;
        }
        string finalLine = "";
        for (int i = 0; i < currWords.size(); i++) {
            finalLine += currWords[i];
            finalLine += " ";
        }
        string space(maxWidth - finalLine.size(), ' ');
        finalLine += space;
        output.push_back(finalLine);
        return output;
    }
};

vector<string> vectorFromArray(string* array, int size) {
	vector<string> vector;
	for (int i = 0; i < size; i++) {
		vector.push_back(array[i]);
	}
	return vector;
}

int main() {
	int size, maxWidth;
	cout << "Input size: ";
	cin >> size;
	string* wordsArr = new string[size];
	cout << "Input words:" << endl;
	string word;
	for (int i = 0; i < size; i++) {
		cin >> word;
		wordsArr[i] = word;
	}
	vector<string> words = vectorFromArray(wordsArr, size);
	cout << "Input max width: ";
	cin >> maxWidth;
	Solution solution;
	vector<string> justified = solution.fullJustify(words, maxWidth);
	for (string line : justified) {
		cout << line << endl;
	}
}