题解 | #最长回文子串# 暴力

import java.math.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.concurrent.atomic.*;
import java.util.stream.*;
import java.util.regex.*;
import java.util.function.*;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        String line = in.nextLine();
        int max = 0;
        // 不是全排列 直接两次遍历就行
        for (int i = 0; i < line.length(); i++) {
            for (int j = i + 1; j < line.length() + 1; j++) {
                String s = line.substring(i, j);
                if (s.equals(new StringBuilder(s).reverse().toString())) {
                    max = Math.max(max, s.length());
                }
            }
        }
        System.out.println(max);
    }
}