Prime In Diagonal
You are given a 0-indexed two-dimensional integer array nums.
Return the largest prime number that lies on at least one of the diagonals of nums. In case no prime is present on any of the diagonals, return 0.
Note that:
- An integer is prime if it is greater than
1and has no positive integer divisors other than1and itself. - An integer
valis on one of the diagonals ofnumsif there exists an integerifor whichnums[i][i] = valor anifor whichnums[i][nums.length - i - 1] = val.
Example 1
Input
nums = [[1,2,3],[5,6,7],[9,10,11]]Output
11The numbers 1, 3, 6, 9, and 11 are the only numbers present on at least one of the diagonals, and 11 is the largest prime.
Example 2
Input
nums = [[1,2,3],[5,17,7],[9,11,10]]Output
17The numbers 1, 3, 9, 10, and 17 are all present on at least one of the diagonals, and 17 is the largest prime.
Constraints
- 1 <= nums.length <= 300
- nums.length == numsi.length
- 1 <= nums[i][j] <= 4*10^6