[LeetCode] Prime Palindrome 质数回文数
Find the smallest prime palindrome greater than or equal to N.
Recall that a number is prime if it's only divisors are 1 and itself, and it is greater than 1.
SRE实战 互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。For example, 2,3,5,7,11 and 13 are primes.
Recall that a number is a palindrome if it reads the same from left to right as it does from right to left.
For example, 12321 is a palindrome.
Example 1:
Input: 6
Output: 7Example 2:
Input: 8
Output: 11Example 3:
Input: 13
Output: 101Note:
1 <= N <= 10^8- The answer is guaranteed to exist and be less than
2 * 10^8.
参考资料：
https://leetcode.com/problems/prime-palindrome/
LeetCode All in One 题目讲解汇总(持续更新中...)
更多精彩
