code-for-hacktoberfest/Word-wrap.cpp at main · shammoOO7/code-for-hacktoberfest · 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
#include <bits/stdc++.h>
using namespace std;

int solveWordWrapUsingMemo(int words[], int n, int length,
						int wordIndex, int remLength,
						vector<vector<int> > memo);

int square(int n) { return n * n; }

int solveWordWrapUtil(int words[], int n, int length,
					int wordIndex, int remLength,
					vector<vector<int> > memo)
{
	if (wordIndex == n - 1) {
		memo[wordIndex][remLength]
			= words[wordIndex] < remLength
				? 0
				: square(remLength);
		return memo[wordIndex][remLength];
	}

	int currWord = words[wordIndex];
	if (currWord < remLength) {
		return min(solveWordWrapUsingMemo(
					words, n, length, wordIndex + 1,
					remLength == length
						? remLength - currWord
						: remLength - currWord - 1,
					memo),

				square(remLength)
					+ solveWordWrapUsingMemo(
						words, n, length, wordIndex + 1,
						length - currWord, memo));
	}
	else {
		return square(remLength)
			+ solveWordWrapUsingMemo(
				words, n, length, wordIndex + 1,
				length - currWord, memo);
	}
}

int solveWordWrapUsingMemo(int words[], int n, int length,
						int wordIndex, int remLength,
						vector<vector<int> > memo)
{
	if (memo[wordIndex][remLength] != -1) {
		return memo[wordIndex][remLength];
	}

	memo[wordIndex][remLength] = solveWordWrapUtil(
		words, n, length, wordIndex, remLength, memo);
	return memo[wordIndex][remLength];
}

int solveWordWrap(int words[], int n, int k)
{

	vector<vector<int> > memo(n, vector<int>(k + 1, -1));

	return solveWordWrapUsingMemo(words, n, k, 0, k, memo);
}
int main()
{
	int words[] = { 3, 2, 2, 5 };
	int n = sizeof(words) / sizeof(words[0]);
	int k = 6;

	cout << solveWordWrap(words, n, k);
	return 0;
}