青墨书晚风
原文链接: https://leetcode-cn.com/problems/prime-palindrome 英文原文Given an integer n, return the smallest prime palindrome greater than or equal to n. An integer is prime if it has exactly two divisors: 1 and itself. Note that 1 is not a prime number. For …