1.题目
找出所有子集的异或总和再求和 - 力扣(LeetCode)https://leetcode.cn/problems/sum-of-all-subset-xor-totals/description/
2.思路
3.C++实现代码
class Solution {
public:
int path;
int sum;
int subsetXORSum(vector<int>& nums)
{
dfs(nums,0);
return sum;
}
void dfs(vector<int>& nums,int pos)
{
sum+=path;
for(int i=pos;i<nums.size();i++)
{
path^=nums[i];
dfs(nums,i+1);
path^=nums[i];
}
}
};