Skip to content

Create 1312_Minimum_Insertion_Steps_to_Make_a_String_Palindrome.cpp #116

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create 1312_Minimum_Insertion_Steps_to_Make_a_String_Palindrome.cpp #116

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions 1312_Minimum_Insertion_Steps_to_Make_a_String_Palindrome.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
class Solution {
public:
int solve(int s, int e, string &str, vector<vector<int>> &dp){
if(s > e || s == e)
return 0;
if(dp[s][e] != -1) return dp[s][e];

if(str[s] == str[e])
return dp[s][e] = solve(s+1, e-1, str,dp);
else
return dp[s][e] = 1 + min(solve(s+1, e, str, dp), solve(s, e - 1, str,dp));
}
int minInsertions(string s) {
int n = s.size();
vector<vector<int>> dp(n, vector<int>(n, -1));
return solve(0, n-1, s, dp);
}
};