2523. Closest Prime Numbers in Range

最新推荐文章于 2024-10-08 10:36:00 发布

ujn20161222

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量148

点赞数 3

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/141891794

版权

https://leetcode.com/problems/closest-prime-numbers-in-range/description/?envType=company&envId=tiktok&favoriteSlug=tiktok-three-months

class Solution:
    def closestPrimes(self, left: int, right: int) -> List[int]:
        sieve=[False]*(right+1)

        results=[-1,-1]
        prep=-1
        for p in range(2,right+1):
            if not sieve[p]:
                for p2 in range(p*2,right+1,p):
                    sieve[p2]=True
                if left<=p<=right:
                    if results[0]==-1:
                        results[0]=p
                    elif results[1]==-1:
                        results[1]=p
                    else:
                        # print(p,results)
                        if p-prep<results[1]-results[0]:
                            results=[prep,p]
                    prep=p
        if results[0]==-1 or results[1]==-1:
            return [-1,-1]
        else:return results

prep保存上一个prime, results只有上一个距离最近的prime不一定是上一个