Leetcode:516. Longest Palindromic Subsequence

哎呀妈呀脑壳疼脑壳疼

于 2017-12-18 12:37:00 发布

阅读量89

点赞数

本文链接：https://blog.csdn.net/u013983628/article/details/86163651

版权

Leetcode:516. Longest Palindromic Subsequence

参考：http://algorithms.tutorialhorizon.com/longest-palindromic-subsequence/ （老外写的博文，有图有字很形象）http://blog.csdn.net/thesnowboy_2/article/details/55251028（中文博客，动态规划解题分析）

public class Solution {
    public int longestPalindromeSubseq(String s) {
        int[][] dp = new int[s.length()][s.length()];
        
        for (int i = s.length() - 1; i >= 0; i--) {
            dp[i][i] = 1;
            for (int j = i+1; j < s.length(); j++) {
                if (s.charAt(i) == s.charAt(j)) {
                    dp[i][j] = dp[i+1][j-1] + 2;
                } else {
                    dp[i][j] = Math.max(dp[i+1][j], dp[i][j-1]);
                }
            }
        }
        return dp[0][s.length()-1];
    }
}