Longest Palindromic Substring

来源:互联网 发布:筑巢软件骗局 编辑:程序博客网 时间:2024/06/05 22:42
public class Solution {        public String longestPalindrome(String s) {        if (s == null || s.length() == 0) {            return "";        }        if (s.length() == 1) {            return s;        }        String maxStr = "";        for (int i = 0; i < 2*s.length() - 1; i++) {            int left = i/2;            int right = i/2;            if (i%2 == 1) {                right++;            }            String str = helper(s, left, right);            maxStr = (str.length() - maxStr.length() > 0) ? str : maxStr;        }        return maxStr;    }        private String helper(String s, int left, int right) {        while (left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) {            left--;            right++;        }        return s.substring(left + 1, right);    }}

0 0