PHP-Fusion Powered Website - Articles: Palindrome Partitioning Problem in C++

Users Online

· Guests Online: 25

· Members Online: 0

· Total Members: 188
· Newest Member: meenachowdary055

Forum Threads

Newest Threads

No Threads created

Hottest Threads

No Threads created

Latest Articles

· How to Set Priorities
· Chart of Accounts
· Types of Cyber Attacks
· How Https works
· Security Camera

Oh no! Where's the JavaScript?
Your Web browser does not have JavaScript enabled or does not support JavaScript. Please enable JavaScript on your Web browser to properly view this Web site,
or upgrade to a Web browser that does support JavaScript; Firefox, Safari, Opera, Chrome or a version of Internet Explorer newer then version 6.

Articles Hierarchy

Articles Home » C++ » Palindrome Partitioning Problem in C++

Palindrome Partitioning Problem in C++

This C++ Program Solves Palindrome Partitioning Problem.

Here is source code of the C++ Program to solve Palindrome Partitioning Problem. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C++ Program to Solve Palindrome Partitioning Problem

```
 */
```
```
#include <iostream>
```
```
#include <cstdio>
```
```
#include <cstring>
```
```
#include <climits>
```
```
#include <cstring>
```
```
#include <cstdlib>
```
```
using namespace std;
```
```
 
```
```
// get minimum of two integers
```
```
int min (int a, int b)
```
```
{
```
```
    return (a < b)? a : b;
```
```
}
```
```
 
```

/* Returns the minimum number of cuts needed to partition a string

 * such that every part is a palindrome

```
 */
```
```
int minPalPartion(char *str)
```
```
{
```
```
    int n = strlen(str);
```
```
    int C[n][n];
```
```
    bool P[n][n];
```
```
    int i, j, k, L;
```
```
    for (i = 0; i < n; i++)
```
```
    {
```
```
        P[i][i] = true;
```
```
        C[i][i] = 0;
```
```
    }
```
```
    for (L = 2; L <= n; L++)
```
```
    {
```
```
        for (i = 0; i < n - L + 1; i++)
```
```
        {
```
```
            j = i + L - 1;
```
```
            if (L == 2)
```

                P[i][j] = (str[i] == str[j]);

```
            else
```

                P[i][j] = (str[i] == str[j]) && P[i + 1][j - 1];

```
            if (P[i][j] == true)
```
```
                C[i][j] = 0;
```
```
            else
```
```
            {
```
```
                C[i][j] = INT_MAX;
```

                for (k = i; k <= j - 1; k++)

                    C[i][j] = min (C[i][j], C[i][k] + C[k + 1][j] + 1);

```
            }
```
```
        }
```
```
    }
```
```
    return C[0][n-1];
```
```
}
```
```
 
```
```
// Main
```
```
int main()
```
```
{
```
```
    char str[] = "ababbbabbababa";
```

    cout<<"Min cuts needed for Palindrome Partitioning is: "<<minPalPartion(str);

```
    cout<<endl;
```
```
    return 0;
```
```
}
```

$ g++ palindrome_partitioning.cpp
$ a.out
 
Min cuts needed for Palindrome Partitioning is: 3
 
------------------
(program exited with code: 1)
Press return to continue

Users Online

Forum Threads

Latest Articles

Articles Hierarchy

Palindrome Partitioning Problem in C++

Palindrome Partitioning Problem in C++

Comments

Post Comment

Ratings