summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorcrupest <crupest@outlook.com>2021-09-24 21:48:27 +0800
committercrupest <crupest@outlook.com>2021-09-24 21:48:27 +0800
commit450e391b6feb6e6dcefd07a3b85dfd23b69fa283 (patch)
treedeaaae411b93ce7a723f9bdefa17f3fbe196e465
parent7d658905c737287476d8da546fc53a2c23c89571 (diff)
downloadsolutions-450e391b6feb6e6dcefd07a3b85dfd23b69fa283.tar.gz
solutions-450e391b6feb6e6dcefd07a3b85dfd23b69fa283.tar.bz2
solutions-450e391b6feb6e6dcefd07a3b85dfd23b69fa283.zip
Add leetcode 47.
-rw-r--r--leetcode/cpp/47.cpp45
1 files changed, 45 insertions, 0 deletions
diff --git a/leetcode/cpp/47.cpp b/leetcode/cpp/47.cpp
new file mode 100644
index 0000000..4a109ea
--- /dev/null
+++ b/leetcode/cpp/47.cpp
@@ -0,0 +1,45 @@
+#include <vector>
+#include <set>
+
+using std::vector;
+
+class Solution {
+public:
+
+ void DFS(int length, const std::vector<int>& nums, std::vector<int>& visited, std::vector<int>& current, std::vector<std::vector<int>>& result) {
+ if (length == 0) {
+ result.push_back(current);
+ }
+
+ int used[21] {0};
+
+ int size = nums.size();
+
+ for (int i = 0; i < size; i++) {
+ if (visited[i]) {
+ continue;
+ }
+
+ visited[i] = 1;
+
+ int num = nums[i];
+
+ if (!used[num + 10]) {
+ current.push_back(nums[i]);
+ DFS(length - 1, nums, visited, current, result);
+ current.pop_back();
+ used[num + 10] = 1;
+ }
+
+ visited[i] = 0;
+ }
+ }
+
+ vector<vector<int>> permuteUnique(vector<int>& nums) {
+ std::vector<int> visited(nums.size());
+ std::vector<int> current;
+ std::vector<std::vector<int>> result;
+ DFS(nums.size(),nums, visited, current, result);
+ return result;
+ }
+}; \ No newline at end of file