add 1863

fishercoder1534 · fishercoder1534 · commit 831db2c3c597 · 2021-05-16T09:06:36.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1863|[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java) ||Easy|Backtracking, Recursion|
 |1862|[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java) ||Hard|Math|
 |1861|[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java) ||Medium|Array, Two Pointers|
 |1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) ||Medium|Math|
diff --git a/src/main/java/com/fishercoder/solutions/_1863.java b/src/main/java/com/fishercoder/solutions/_1863.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _1863 {
+    public static class Solution1 {
+        public int subsetXORSum(int[] nums) {
+            int sum = 0;
+            List<List<Integer>> subsets = subsets(nums);
+            for (List<Integer> subset : subsets) {
+                int xor = 0;
+                for (int i : subset) {
+                    xor ^= i;
+                }
+                sum += xor;
+            }
+            return sum;
+        }
+
+        public List<List<Integer>> subsets(int[] nums) {
+            List<List<Integer>> result = new ArrayList();
+            backtracking(result, new ArrayList(), nums, 0);
+            return result;
+        }
+
+        void backtracking(List<List<Integer>> result, List<Integer> list, int[] nums, int start) {
+            result.add(new ArrayList(list));
+            for (int i = start; i < nums.length; i++) {
+                list.add(nums[i]);
+                backtracking(result, list, nums, i + 1);
+                list.remove(list.size() - 1);
+            }
+        }
+    }
+}
