int solve(vector<int>& nums) { unordered_set<int> data; int res = 0; int local = 0; for (int i = 0; i < nums.size(); ++i) { local = local ^ nums[i]; if (local == 0 || data.count(local)) { ++res; local = 0; data.clear(); } else { data.insert(local); } } return res; } 简单来说就是用local...
