LeetCode 解码异或后的数组

class Solution {
    
    
public:
    vector<int> decode(vector<int>& encoded, int first) {
    
    
        vector<int> ans;
        ans.push_back(first);

        for (int i = 0; i < encoded.size(); i++)
        {
    
    
            ans.push_back(ans[i] ^ encoded[i]);
        }
        return ans;
    }
};

猜你喜欢

转载自blog.csdn.net/qq_32862515/article/details/113091999