Longest palindromic subsequence of an array

Write a function to compute the maximum length palindromic sub-sequence of an array. 
A palindrome is a sequence which is equal to its reverse. 
A sub-sequence of an array is a sequence which can be constructed by removing elements of the array. 
Ex: Given [4,1,2,3,4,5,6,5,4,3,4,4,4,4,4,4,4] should return 10 (all 4's) 


Well, I think my whole Christmas eve is filled with DP, palindromes and strings (this one is sort of one...). This is a Linkedin interview question. The solution, as far as I can think of, is DP (again). I had some problem figuring out how to construct the DP matrix. It is an upper (or lower) diagonal matrix with the rows as the start character and columns as the end characters.

Here is a sample matrix, I use string instead of those annoying numbers.
S = "BBABA"

public class PalindromicSubsequence {
 public int maxLengthPalindrome(int[] nums) {
  if (nums == null || nums.length == 0) 
   return 0;
  int[][] palindrome = new int[nums.length][nums.length];
  for (int i = 0; i < nums.length; i++) {
   palindrome[i][i] = 1;
  }
  for (int i = 0; i < nums.length - 1; i++) {
   palindrome[i][i + 1] = nums[i] == nums[i + 1] ? 2 : 1;
  }
  for (int len = 3; len <= nums.length; len++) {
   for (int start = 0; start <= nums.length - len; start++) {
    int end = start + len - 1;
    palindrome[start][end] = Math.max(palindrome[start][end - 1], palindrome[start + 1][end]);
    if (nums[start] == nums[end]) {
     palindrome[start][end] = Math.max(palindrome[start][end], palindrome[start + 1][end - 1] + 2);
    }
   }
  }
  return palindrome[0][nums.length - 1]; 
 }
}