Create 2597. The Number of Beautiful Subsets (#486)

Author: Chayandas07

2597. The Number of Beautiful Subsets

@@ -0,0 +1,29 @@
+class Solution {
+public:
+    int ans;
+    unordered_map<int, int> rec;
+    int beautifulSubsets(vector<int>& nums, int k) {
+        sort(nums.begin(), nums.end());
+        ans = 0;
+        vector<int> tmp;
+        int n = nums.size();
+        for (int i = 0; i < n; ++i) {
+            rec[nums[i]]++;
+            recursion(i+1, n, tmp, nums, k);
+            rec[nums[i]]--;
+        }
+        return ans;
+    }
+    void recursion(int pos, int n, vector<int> &tmp, vector<int>& nums, int k) {
+        if (pos == n) {
+            ans++;
+            return;
+        }
+        if (rec[nums[pos] - k] == 0) {
+            rec[nums[pos]]++;
+            recursion(pos + 1, n, tmp, nums, k);
+            rec[nums[pos]]--;
+        }   
+        recursion(pos + 1, n, tmp, nums, k);   
+    }
+};