-
Notifications
You must be signed in to change notification settings - Fork 0
/
#132 Palindrome Partitioning II.cpp
43 lines (40 loc) · 1.11 KB
/
#132 Palindrome Partitioning II.cpp
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
class Solution {
public:
int minCut(string s) {
mPalindromes.resize(s.length(), vector<int>(s.length(), 2));
dp.resize(s.size(),-1);
return minCut(s,0);
}
private:
int minCut(const string &s, int idx){
if (dp[idx] != -1) {
return dp[idx];
}
int minCuts = INT_MAX;
for(int i = idx; i < s.size(); i++) {
if(checkPalindrome(s, idx, i)){
int cuts = i == s.size() - 1 ? 0 : 1 + minCut(s, i+1);
minCuts = min(minCuts, cuts);
}
}
dp[idx] = minCuts;
return dp[idx];
}
bool checkPalindrome(const string & s, int firstIdx, int lastIdx) {
auto& stored = mPalindromes[firstIdx][lastIdx];
if (stored != 2) {
return stored;
}
for (int i = 0; i < (lastIdx - firstIdx + 1) / 2; ++i) {
if (s[firstIdx + i] != s[lastIdx - i]) {
stored = 0;
return false;
}
}
stored = 1;
return true;
}
private:
vector<vector<int>> mPalindromes;
vector<int> dp;
};