g2301_2400.s2396_strictly_palindromic_number.Solution Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.35

package g2301_2400.s2396_strictly_palindromic_number;

// #Medium #Math #Two_Pointers #Brainteaser #2022_09_14_Time_0_ms_(100.00%)_Space_40.6_MB_(75.27%)

public class Solution {
    public boolean isStrictlyPalindromic(int n) {
        for (int i = 2; i <= n - 2; i++) {
            String num = Integer.toString(i);
            String s = baseConversion(num, 10, i);
            if (!checkPalindrome(s)) {
                return false;
            }
        }
        return true;
    }

    private String baseConversion(String number, int sBase, int dBase) {
        // Parse the number with source radix
        // and return in specified radix(base)
        return Integer.toString(Integer.parseInt(number, sBase), dBase);
    }

    private boolean checkPalindrome(String s) {
        int start = 0;
        int end = s.length() - 1;
        while (start <= end) {
            if (s.charAt(start) != s.charAt(end)) {
                return false;
            }
            start++;
            end--;
        }
        return true;
    }
}