LC.P3115[质数的最大距离]

发表于2024-07-02|更新于2024-07-02|LeetCode

|字数总计:133|阅读时长:1分钟|阅读量:

方法一：遍历

class Solution {
    public int maximumPrimeDifference(int[] nums) {
        int n = nums.length, left = 0, right = 0;
        for (int i = 0; i < n; ++i) {
            if (isPrime(nums[i])) {
                left = i;
                break;
            }
        }
        for (int i = n - 1; i >= 0; --i) {
            if (isPrime(nums[i])) {
                right = i;
                break;
            }
        }
        return right - left;
    }

    private boolean isPrime(int x) {
        if (x < 2) return false;
        for (int i = 2; i * i <= x; ++i) {
            if (x % i == 0) return false;
        }
        return true;
    }
}