diff options
author | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
---|---|---|
committer | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
commit | d8f3b40085619cb680c8f227c65a1f5acc393223 (patch) | |
tree | 6a38e3a6c79276fc396259ef962d17236dbed569 /cpp/526.cpp | |
parent | b0162802ad9723c678e495f29ca2f0fc0af2eff1 (diff) | |
download | solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.tar.gz solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.tar.bz2 solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.zip |
Move leetcode solutions to subdir.
Diffstat (limited to 'cpp/526.cpp')
-rw-r--r-- | cpp/526.cpp | 29 |
1 files changed, 0 insertions, 29 deletions
diff --git a/cpp/526.cpp b/cpp/526.cpp deleted file mode 100644 index 19f445f..0000000 --- a/cpp/526.cpp +++ /dev/null @@ -1,29 +0,0 @@ -#include <vector> - -using std::vector; - -class Solution { -public: - void dfs(int N, int index, bool *num_used, int &result) { - if (index > N) { - result += 1; - return; - } - - for (int num = 1; num <= N; num++) { - if (!num_used[num] && (num % index == 0 || index % num == 0)) { - num_used[num] = true; - dfs(N, index + 1, num_used, result); - num_used[num] = false; - } - } - } - - int countArrangement(int N) { - bool *num_used = new bool[N + 1]{false}; - int result = 0; - dfs(N, 1, num_used, result); - delete[] num_used; - return result; - } -}; |