LeetCode 5 Longest Palindromic Substring

LeetCode  5. Longest Palindromic Substring

https://www.zhihu.com/question/40965749

https://www.felix021.com/blog/read.php?2040

https://blog.csdn.net/ggggiqnypgjg/article/details/6645824

 

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

暴力搜索

class Solution {
    public String longestPalindrome(String s) {
        int len = s.length();
		for(int size=len;size>0;size--)//回文串长度
		{
			for(int low=0,high=low+size-1;high<len;low++,high++){
				if(judgepalindromic(s,low,high)){//判断是否为回文串
				  return s.substring(low,high+1);
				}
			}
		}
		return s.substring(0,0);
        
    }

	
	public boolean judgepalindromic(String s,int low,int high){
		while(low<=high){
			if(s.charAt(low)==s.charAt(high)){
				low++;
				high--;
			}else{
				return false;
			}
			
		}
		return true;
	}
}

 

从中心开始检测

private int mx=0;
	private String res = "";
	public String center(String s){
		for(int i=0;i<s.length();i++){
			checkpalidromic(s,i,i); //单个中心 例如 bab
			checkpalidromic(s,i,i+1);	//两个中心 例如 baab		
		}	
		return res;
	}
	
	public void checkpalidromic(String s,int low,int high){
		while (low>=0&&high<s.length()) {
			if (s.charAt(low)==s.charAt(high)) {
				if (mx<high-low+1) {
					mx = high-low+1;
					res = s.substring(low,high+1);	
				}	
				low--;
				high++;
			}else {
				
				return ;
			}			
		}		
	}