Leetcode 516. Longest Palindromic Subsequence

public class Solution {
    public int longestPalindromeSubseq(String s) {
        StringBuffer tmp = new StringBuffer(s);
        String t = tmp.reverse().toString();
        int[][] dp = new int[s.length()+1][s.length()+1];
        for (int i = 0; i < s.length(); i++) {
            for (int j = 0; j < s.length(); j++) {
                if (s.charAt(i) == t.charAt(j)) {
                    dp[i+1][j+1] = dp[i][j]+1;
                }
                else {
                    dp[i+1][j+1] = Math.max(dp[i][j+1], dp[i+1][j]);
                }
            }
        }
        return dp[s.length()][s.length()];
    }
    public static void main(String[] args) {
        Solution s= new Solution();
        System.out.println(s.longestPalindromeSubseq("bbbab"));
    }
}