Package g0901_1000.s0996_number_of_squareful_arrays

Class Solution

java.lang.Object

g0901_1000.s0996_number_of_squareful_arrays.Solution

public class Solution
extends Object

996 - Number of Squareful Arrays.<p>Hard</p> <p>An array is <strong>squareful</strong> if the sum of every pair of adjacent elements is a <strong>perfect square</strong>.</p> <p>Given an integer array nums, return <em>the number of permutations of</em> <code>nums</code> <em>that are <strong>squareful</strong></em>.</p> <p>Two permutations <code>perm1</code> and <code>perm2</code> are different if there is some index <code>i</code> such that <code>perm1[i] != perm2[i]</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,17,8]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> [1,8,17] and [17,8,1] are the valid permutations.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,2,2]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 12</code></li> <li><code>0 <= nums[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	numSquarefulPerms(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

numSquarefulPerms

public int numSquarefulPerms(int[] nums)