Package g2701_2800.s2741_special_permutations

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2741 - Special Permutations.

    Medium

    You are given a 0-indexed integer array nums containing n distinct positive integers. A permutation of nums is called special if:

    • For all indexes 0 <= i < n - 1, either nums[i] % nums[i+1] == 0 or nums[i+1] % nums[i] == 0.

    Return _the total number of special permutations. _As the answer could be large, return it **modulo **<code>10<sup>9 </sup>+ 7</code>.

    Example 1:

    Input: nums = 2,3,6

    Output: 2

    Explanation: 3,6,2 and 2,6,3 are the two special permutations of nums.

    Example 2:

    Input: nums = 1,4,3

    Output: 2

    Explanation: 3,1,4 and 4,1,3 are the two special permutations of nums.

    Constraints:

    • 2 &lt;= nums.length &lt;= 14

    • <code>1 <= numsi<= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer specialPerm(IntArray nums)

      • Methods inherited from class java.lang.Object

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