Leetcode-516. Longest Palindromic Subsequence

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。这次比赛略无语，没想到前3题都可以用暴力解。

博客链接：mcf171的博客

——————————————————————————————

Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.

Example 1:
Input:

"bbbab"

Output:

4

One possible longest palindromic subsequence is "bbbb".

Example 2:
Input:

"cbbd"

Output:

2

One possible longest palindromic subsequence is "bb".

专门找dp的题目练一练感觉。这个题目也是蛮经典的一个例子。虽然代码有个不合理的地方，但是无伤大雅了，因为程序的特性导致也能cover掉。Your runtime beats 79.00% of java submissions.

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