From d8f3b40085619cb680c8f227c65a1f5acc393223 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: Move leetcode solutions to subdir.

---
 cpp/46.cpp | 34 ----------------------------------
 1 file changed, 34 deletions(-)
 delete mode 100644 cpp/46.cpp

(limited to 'cpp/46.cpp')

diff --git a/cpp/46.cpp b/cpp/46.cpp
deleted file mode 100644
index bfb3c83..0000000
--- a/cpp/46.cpp
+++ /dev/null
@@ -1,34 +0,0 @@
-#include <vector>
-
-using std::vector;
-
-class Solution {
-public:
-  void dfs(const vector<int> &nums, vector<int> &current, bool *num_used,
-           vector<vector<int>> &result) {
-    if (current.size() == nums.size()) {
-      result.push_back(current);
-      return;
-    }
-
-    for (int i = 0; i < nums.size(); i++) {
-      if (!num_used[i]) {
-        num_used[i] = true;
-        current.push_back(nums[i]);
-        dfs(nums, current, num_used, result);
-        current.pop_back();
-        num_used[i] = false;
-      }
-    }
-  }
-
-  vector<vector<int>> permute(vector<int> &nums) {
-    vector<int> current;
-    vector<vector<int>> result;
-    bool *num_used = new bool[nums.size()]{false};
-    dfs(nums, current, num_used, result);
-    delete[] num_used;
-
-    return result;
-  }
-};
-- 
cgit v1.2.3