leetcode516

public class Solution {
    public int LongestPalindromeSubseq(string s) {
        int[,] dp = new int[s.Length, s.Length];

            for (int i = s.Length - ; i >= ; i--)
            {
                dp[i, i] = ;
                for (int j = i + ; j < s.Length; j++)
                {
                    if (s[i] == s[j])
                    {
                        dp[i, j] = dp[i + , j - ] + ;
                    }
                    else
                    {
                        dp[i, j] = Math.Max(dp[i + , j], dp[i, j - ]);
                    }
                }
            }
            return dp[, s.Length - ];
    }
}

https://leetcode.com/problems/longest-palindromic-subsequence/#/description