''' Author: LetMeFly Date: 2025-03-18 23:46:52 LastEditors: LetMeFly.xyz LastEditTime: 2025-03-18 23:48:14 ''' from typing importList from math import sqrt
classSolution: defisPrime(self, n: int) -> bool: if n < 2: returnFalse for i inrange(2, int(sqrt(n)) + 1): if n % i == 0: returnFalse returnTrue
defdiagonalPrime(self, nums: List[List[int]]) -> int: ans = 0 for i inrange(len(nums)): ifself.isPrime(nums[i][i]): ans = max(ans, nums[i][i]) ifself.isPrime(nums[i][len(nums) - i - 1]): ans = max(ans, nums[i][len(nums) - i - 1]) return ans
/* * @Author: LetMeFly * @Date: 2025-03-18 23:50:23 * @LastEditors: LetMeFly.xyz * @LastEditTime: 2025-03-18 23:55:24 */ classSolution { privatebooleanisPrime(int n) { if (n < 2) { returnfalse; } intk= (int)Math.sqrt(n); for (inti=2; i <= k; i++) { if (n % i == 0) { returnfalse; } } returntrue; }
publicintdiagonalPrime(int[][] nums) { intans=0; for (inti=0; i < nums.length; i++) { if (isPrime(nums[i][i])) { ans = Math.max(ans, nums[i][i]); } if (isPrime(nums[i][nums.length - i - 1])) { ans = Math.max(ans, nums[i][nums.length - i - 1]); } } return ans; } }
funcisPrime2614(n int) (ans bool) { if n < 2 { return } for i := 2; i * i <= n; i++ { if n % i == 0 { return } } returntrue }
funcdiagonalPrime(nums [][]int) (ans int) { for i := range nums { if isPrime2614(nums[i][i]) { ans = max(ans, nums[i][i]) } if isPrime2614(nums[i][len(nums) - i - 1]) { ans = max(ans, nums[i][len(nums) - i - 1]) } } return }