
[LeetCode] 2523. Closest Prime Numbers in Range (Python)

·
알고리즘/LeetCode
난이도: MediumProblem DescriptionGiven two positive integers left and right, find the two integers num1 and num2 such that:left .Both num1 and num2 are prime numbers.num2 - num1 is the minimum amongst all other pairs satisfying the above conditions.Return the positive integer array ans = [num1, num2]. If there are multiple pairs satisfying these conditions, return the one with the smallest num1 val..