LongestPalindrome.java

  private static int longestPalindrome(String str)
    {
        int N = str.length();
        int maxLength = 1;
        if(N > 1)
        {
            int[] solution = new int[N];
            for (int i = 1; i < N; i++) {
                char ci = str.charAt(i);
                for (int j = 0; j < i; j++) {
                    if(str.charAt(j) == ci)
                    {
                        int maxKIndex = j + 1;
                        for (int k = j + 2; k < i; k++) {
                            if(solution[maxKIndex] < solution[k]) maxKIndex = k;
                        }

                        if(solution[maxKIndex] == 0)
                            solution[j] = maxof3(solution[j], 2 + (i - j > 1 ? 1 : 0), 1);
                        else
                            solution[j] = maxof3(solution[j], 2 + solution[maxKIndex], 1);

                        //println("Char " + j  +" c>" + ci + ">" + solution[j] + ">|" +  Array2String(solution, ""));
                    }
                }


            }

            for (int i = 0; i < N; i++) {
                if(maxLength < solution[i])
                    maxLength = solution[i];
            }

          //  println(Array2String(solution, ""));
        }
        else
            maxLength = N;
        return maxLength;
    }
  
  private static int maxof3(int a, int b, int c)
  {
      int max = a;
      if(b > max) max = b;
      if(c > max) max = c;
      return max;
  }