aboutsummaryrefslogtreecommitdiff
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
commit8eb02362780883d16acc31c51225f6e9196405f2 (patch)
tree810a28be972dcc76df6e9fb84e12ca4afcd343d2
parent02df09d6e18db2380028e82923ccaba3bfbbec0d (diff)
downloadcrupest-8eb02362780883d16acc31c51225f6e9196405f2.tar.gz
crupest-8eb02362780883d16acc31c51225f6e9196405f2.tar.bz2
crupest-8eb02362780883d16acc31c51225f6e9196405f2.zip
import(solutions): Add leetcode 47.
-rw-r--r--works/solutions/leetcode/cpp/47.cpp45
1 files changed, 45 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/47.cpp b/works/solutions/leetcode/cpp/47.cpp
new file mode 100644
index 0000000..4a109ea
--- /dev/null
+++ b/works/solutions/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