From dc1f0c4c0096013799416664894c5194dc7e1f52 Mon Sep 17 00:00:00 2001
From: Yuqian Yang <crupest@crupest.life>
Date: Fri, 28 Feb 2025 23:13:39 +0800
Subject: chore(store): move everything to store.

---
 works/solutions/leetcode/cpp/47.cpp | 45 -------------------------------------
 1 file changed, 45 deletions(-)
 delete mode 100644 works/solutions/leetcode/cpp/47.cpp

(limited to 'works/solutions/leetcode/cpp/47.cpp')

diff --git a/works/solutions/leetcode/cpp/47.cpp b/works/solutions/leetcode/cpp/47.cpp
deleted file mode 100644
index 4a109ea..0000000
--- a/works/solutions/leetcode/cpp/47.cpp
+++ /dev/null
@@ -1,45 +0,0 @@
-#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
-- 
cgit v1.2.3