【无标题】

最长回文子串（C++ and Java)

java

package za;



public class longestPalindrome {
    public static void main(String[] args) {
        String s = "babad";
        System.out.println(s);
        Solution_2 result = new Solution_2();
        String str = result.longestPalindrome(s);
        System.out.println(str);
    }
}





//暴力枚举解法，双循环解法,回会超时，不能使用
class Solution_1 {
    public String longestPalindrome(String s) {
          int len = s.length();//字符串长度
          String temp ="";//存放循环中子串
          String result = "";//存放最终结果
          for (int i = 0; i < len; i++) {
                for (int j = i; j < len; j++) {
                    temp = temp + s.charAt(j);
                    String tem = temp;
                    tem = new StringBuffer(tem).reverse().toString();
                    if (temp.equals(tem)) {
                        if (result.length() > temp.length()) {
                            result = result;
                        } else {
                            result = temp;
                        }
                    }
                }
                    temp = "";
        }
       return result;
    }
}


//动态规划算法,效果较好
class Solution_2 {
    public String longestPalindrome(String s) {
        int len = s.length();//字符串长度
        if(len <= 2){
            return s;
        }
        int maxLen = 1;//最长长度
        int begin = 0;//开始位置
        //定义状态容器
        int data[][]=new int[len][len];
        for (int j = 1; j < len; j++) {
            for (int i = 0; i < len -1; i++) {
                if(s.charAt(i)!=s.charAt(j)) {
                    data[i][j] = 0;
                }else{
                    if(j-i<3){
                        data[i][j]=1;
                    }else{
                        data[i][j]=data[i+1][j-1];
                    }
                }
                if (data[i][j] == 1 && j - i + 1 > maxLen) { //judge max length and record
                    maxLen = j - i + 1;//record max length
                    begin = i;//record begin position
                }

            }

        }
        return s.substring(begin,begin+maxLen);
    }
}

动态规划

状态容器变化

C++

#include <iostream>
#include <unordered_set>
#include <map>
#include<string.h>
#include <algorithm>
#include <typeinfo>
#include<stack>
#include<queue>

typedef unsigned char boolean;

/*
 * 最长回文子串c++解法
 */
using namespace std;


//暴力双循环解法
class Solution_1 {
public:
    string longestPalindrome(string s) {
        string res="";//存放结果
        string temp="";//存放子串
        //双循环方法,遍历每一个字符
        for(int i=0;i<s.length();i++)
        {
            for(int j=i;j<s.length();j++)
            {
                temp=temp+s[j];
                string tem=temp;//tem存放子串反转结果
                reverse(tem.begin(),tem.end());//将tem字符串进行反转
                //如果该子串与其反转子串相同，比较res和temp的长度
                if(temp==tem)
                    res=res.length()>temp.length()?res:temp;
            }
            //将temp置空
            temp="";
        }
        return res;
    }
};



//动态规划法
class Solution_3 {
public:
    string longestPalindrome(string s) {
        int len = s.size();//字符串长度
        if (len <= 1) {
            return s;//len为0或者1，返回len
        }
        int maxLen = 1;//最长长度
        int begin = 0;//开始位置
        vector<vector<int>>  dp(len, vector<int>(len));//定义状态容器，长宽为len的二维数组
        //当i=j的时候，满足条件；
        for (int i = 0; i < len; i++) {
            dp[i][i] = 1;
        }
        //遍历str
        for (int j = 1; j < len; j++)
        {
            for (int i = 0; i < len-1 && i < j; i++)
            {
                if(s[i]!=s[j]) {
                    dp[i][j] = 0;
                }else{
                    if(j-i<3){
                        dp[i][j]=1;
                    }else{
                        dp[i][j]=dp[i+1][j-1];
                    }
                }
                if (dp[i][j] && j - i + 1 > maxLen) { //judge max length and record
                    maxLen = j - i + 1;//record max length
                    begin = i;//record begin position
                }
            }
        }

        return s.substr(begin, maxLen);//return palindromic substring
    }
};




//主函数
int main() {
    //最长回文子串
    string str1 = "babad";
    Solution_3 test;
    string num = test.longestPalindrome(str1);
    cout<<"-----------------"<<endl;
    cout<<num<<endl;
    return 0;
}