Leetcode刷题笔记(c++)

class Solution {
public:
    vector singleNumbers(vector& nums) {
        int ret=0;
        int n=nums.size();
        for(int i:nums)ret=ret^i;
        int div=1;
        while((ret&div)==0)div=div<<1;
        vectorout(2,0);
        for(int i=0;i
            if(nums[i]&div)out[0]=out[0]^nums[i];
            else out[1]=out[1]^nums[i];
        }
        return out;
    }
};

class Solution {
public:
    vector constructArr(vector& a) {
        if(a.empty())return a;
        int n=a.size();
        vectorhashmap1(n);
        vectorhashmap2(n);
        hashmap1[0]=1;
        hashmap2[0]=1;
        for(int i=1;i
            hashmap1[i]=hashmap1[i-1]*a[i-1];
        }
        int temp_right=1;
        for(int i=n-1;i>-1;i--){
            hashmap1[i]=hashmap1[i]*temp_right;
            temp_right=temp_right*a[i];
        }       
        return hashmap1;
    }
};