Make The All of Combination from Palindrome

Question

I have a problem for my task. I must make a program that the input is a palindrome / not a palindrome, and the output is return the substring of the string that can be a palindrome in recursive. Example :

"marah" , the output should be, ("m","a","r","a","h") , ("m","ara","h") . I dont know to implement this in recursive. Please anyone who can help me, i'm very need that code. I worked it in java. Thank you, i hope there is a help coming :D .

public static String palindrome(String s) {
    String s, sub;
    int i, c, length;
    Scanner in = new Scanner(System.in);
    System.out.println("Enter a string to print it's all substrings");
    s = in.nextLine();
    length = string.length();
    System.out.println("Substrings of \"" + string + "\" are :-");
    for (c = 0; c < length; c++) {
      for (i = 1; i <= length - c; i++) {
        sub = string.substring(c, c + i);
        System.out.println(sub);
      }
    }
  }

Please edit your question to add code - it is impossible to read in a comment. — Andy Turner, Mar 10 '16 at 14:15
Sorry i'm new here, can't make the right way to paste a code to the comment — DJ El-Drago, Mar 10 '16 at 14:15
The code can only print the substring, and doesnt check the palindrome. How can i make it? Also in recursive? — DJ El-Drago, Mar 10 '16 at 14:20
this may be a duplicate of [this](http://stackoverflow.com/questions/15722624/check-for-palindrome-recursively?rq=1) — Rhayene, Mar 10 '16 at 14:43

score 0 · Answer 1 · answered Mar 10 '16 at 15:01

public static String longestPalindrome(String s) {
    if (s.isEmpty()) {
        return null;
    }

    if (s.length() == 1) {
        return s;
    }

    String longest = s.substring(0, 1);
    for (int i = 0; i < s.length(); i++) {
        // get longest palindrome with center of i
        String tmp = helper(s, i, i);
        if (tmp.length() > longest.length()) {
            longest = tmp;
        }

        // get longest palindrome with center of i, i+1
        tmp = helper(s, i, i + 1);
        if (tmp.length() > longest.length()) {
            longest = tmp;
        }
    }

    return longest;
}

// Given a center, either one letter or two letter, 
// Find longest palindrome
public static String helper(String s, int begin, int end) {
    while (begin >= 0 && end <= s.length() - 1 && s.charAt(begin) == s.charAt(end)) {
        begin--;
        end++;
    }
    return s.substring(begin + 1, end);
}

if the input is "mama", the output is only "ama", the expected is, "m","a","m","a" , "mam","a" , and "m","ama" . Anybody can help?

score 0 · Answer 2 · answered Mar 11 '16 at 16:31

0

This is called palindrom partition, you can find it here http://www.programcreek.com/2013/03/leetcode-palindrome-partitioning-java/

answered Mar 11 '16 at 16:31

user6050975

1

Make The All of Combination from Palindrome

2 Answers2