3115. 质数的最大距离

质数的最大距离

• 难度: medium
• 原始链接: https://leetcode.cn/problems/maximum-prime-difference
• 标签: 循环

解法一: 循环

go

func maximumPrimeDifference(nums []int) int {
  left := 0
  right := len(nums) - 1
  for left <= right {
    if isPrime(nums[left]) {
      break
    }
    left++
  }
  for right >= left {
    if isPrime(nums[right]) {
      break
    }
    right--
  }
  return right - left
}

func isPrime(num int) bool {
  for i := 2; i*i <= num; i++ {
    if num%i == 0 {
      return false
    }
  }
  return num >= 2
}