Commit 91beb4a

committed

Palindrome partitioning II top down solution implemented

1 parent 9740419 commit 91beb4aCopy full SHA for 91beb4a

File tree

+19

-0

lines changed

+19

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,25 @@`
`1`	`1`	`class Solution {`
	`2`	`+ int minCut(int i, int j, string const& s, vector<vector<int>>& dp) {`
	`3`	`+ if(i >= j) {`
	`4`	`+ return 0;`
	`5`	`+ }`
	`6`	`+ if(dp[i][j] != INT_MAX) {`
	`7`	`+ return dp[i][j];`
	`8`	`+ }`
	`9`	`+ if(s[i] == s[j] and minCut(i + 1, j - 1, s, dp) == 0) {`
	`10`	`+ return dp[i][j] = 0;`
	`11`	`+ }`
	`12`	`+ int Min = j - i;`
	`13`	`+ for(int k = i; k < j; k++) {`
	`14`	`+ Min = min(Min, 1 + minCut(i, k, s, dp) + minCut(k + 1, j, s, dp));`
	`15`	`+ }`
	`16`	`+ return dp[i][j] = Min;`
	`17`	`+ }`
`2`	`18`	`public:`
`3`	`19`	`int minCut(string s) {`
	`20`	`+ // vector<vector<int>> dp(s.length(), vector<int>(s.length(), INT_MAX));`
	`21`	`+ // return minCut(0, s.length() - 1, s, dp);`
	`22`	`+`
`4`	`23`	`const int SIZE = s.length();`
`5`	`24`	`vector<int> minCuts(SIZE + 1, 0);`
`6`	`25`	`for (int i = 0; i <= SIZE; i++) {`

Comments

(0)