目录
1.只出现一次的数字
class Solution {
public:
int singleNumber(vector<int>& nums) {
int val = 0;
for(size_t i = 0;i<nums.size();i++)
val^= nums[i];
return val;
}
};
class Solution {
public:
int singleNumber(vector<int>& nums) {
int val = 0;
for(auto e : nums)
val^= e;
return val;
}
};
2.杨辉三角
class Solution {
public:
vector<vector<int>> generate(int numRows) {