CPMagical CP Library

Problem solution · Java

Special Permutations

Special Permutations: a Java solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Direct simulation
Source
walkccc LeetCode Solutions
Length
40 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For Special Permutations, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 40 lines of Java from the credited upstream file 2741.java.
  • The implementation visibly relies on sequence storage.
  • 2 loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeSpecial Permutations · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int specialPerm(int[] nums) {    final int n = nums.length;    final int maxMask = 1 << n;    int ans = 0;    int[][] mem = new int[n][maxMask];     for (int i = 0; i < n; ++i) {      ans += specialPerm(nums, i, 1 << i, maxMask, mem);      ans %= MOD;    }     return ans;  }   private static final int MOD = 1_000_000_007;   // Returns the number of special permutations, where the previous number is  // nums[i] and `mask` is the bitmask of the used numbers.  private int specialPerm(int[] nums, int prev, int mask, int maxMask, int[][] mem) {    if (mask == maxMask - 1)      return 1;    if (mem[prev][mask] != 0)      return mem[prev][mask];     int res = 0;     for (int i = 0; i < nums.length; ++i) {      if ((mask >> i & 1) == 1)        continue;      if (nums[i] % nums[prev] == 0 || nums[prev] % nums[i] == 0) {        res += specialPerm(nums, i, mask | 1 << i, maxMask, mem);        res %= MOD;      }    }     return mem[prev][mask] = res;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗