aboutsummaryrefslogtreecommitdiff
path: root/other/permutations2.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
committerJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
commita96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch)
treee2a2b3f49f9fb741be81415266ac93e74cff42ec /other/permutations2.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/permutations2.cpp')
-rw-r--r--other/permutations2.cpp29
1 files changed, 0 insertions, 29 deletions
diff --git a/other/permutations2.cpp b/other/permutations2.cpp
deleted file mode 100644
index 16d0162..0000000
--- a/other/permutations2.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- vector<vector<int>> permuteUnique(vector<int> &nums) {
- vector<vector<int>> ans;
- helper(0, nums, ans);
- return ans;
- }
-
-private:
- void helper(int i, vector<int> &nums, vector<vector<int>> &ans) {
- if (i == nums.size()) {
- ans.emplace_back(nums);
- return;
- }
- unordered_set<int> us;
- for (int j = i; j < nums.size(); j++) {
- if (us.count(nums[j]) == 1)
- continue;
- us.insert(nums[j]);
- swap(nums[i], nums[j]);
- helper(i + 1, nums, ans);
- swap(nums[i], nums[j]);
- }
- }
-};
-
-int main() {}