LeetCode 005 Longest Palindromic Substring

题目

---

字符串中最长回文子串

代码

---

public class Solution {
    public String longestPalindrome(String s) {
        if(s == null || s.length() == 0){
            return s;
        }
        
        int n = s.length();
        String ans = "";
        
        for(int i=0;i<n;i++){
            String cur = useme(s,i,i);
            if(cur.length()>ans.length()){
                ans = cur;
            }
            cur = useme(s,i,i+1);
            if(cur.length()>ans.length()){
                ans = cur;
            }
            
        }
        
        return ans;
    }
    
    public String useme(String s, int c1,int c2){
        int l = c1;
        int r = c2;
        while(l>=0 && r<s.length() && s.charAt(l) == s.charAt(r)){
            l--;
            r++;
        }
        return s.substring(l+1,r);
    }
}

思路

---

每个index作为当中取回文，