• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2701_2800.s2741_special_permutations.readme.md Maven / Gradle / Ivy

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 **109 + 7.

**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 <= nums.length <= 14`
*   1 <= nums[i] <= 109