1、题目
https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/
2、题意
题解1:异或所有数字最后剩下的就是结果
class Solution {
public:
int singleNumber(vector<int>& nums) {
int res=0;
for(auto x : nums) res^=x;
return res;
}
};
https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/
题解1:异或所有数字最后剩下的就是结果
class Solution {
public:
int singleNumber(vector<int>& nums) {
int res=0;
for(auto x : nums) res^=x;
return res;
}
};