[leetcode] 526. Beautiful Arrangement

Question :

Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the ith position (1 <= i <= N) in this array:

1. The number at the ith position is divisible by i.
2. i is divisible by the number at the ith position.

Now given N, how many beautiful arrangements can you construct?

Example 1:
Input: 2
Output: 2
Explanation: 

The first beautiful arrangement is [1, 2]:

Number at the 1st position (i=1) is 1, and 1 is divisible by i (i=1).

Number at the 2nd position (i=2) is 2, and 2 is divisible by i (i=2).

The second beautiful arrangement is [2, 1]:

Number at the 1st position (i=1) is 2, and 2 is divisible by i (i=1).

Number at the 2nd position (i=2) is 1, and i (i=2) is divisible by 1.

Note:
N is a positive integer and will not exceed 15.

Solution :

算是暴力求解，对1到N的每一个位置尝试所有符合的数，看是否能形成一个长度为N的数组。

class Solution {
public:
    int countArrangement(int N) {
        vector<bool> visited(N+1, false);
        int ret = 0;
        helper(N, 1, visited, ret);
        return ret;
    }

    void helper(int N, int pos, vector<bool>& visited, int & ret) {
        if (pos > N) {
            ret++;
        }
        for (int i = 1; i <= N; i++) {
            if (!visited[i] && (i % pos == 0 || pos % i == 0)) {
                visited[i] = true;
                helper(N, pos+1, visited, ret);
                visited[i] = false;
            }
        }
    }
};