1720. 解码异或后的数组
链接:https://leetcode-cn.com/problems/decode-xored-array/solution/javac-li-yong-yi-huo-yun-suan-te-dian-by-59f2/
解题思路
利用异或运算 x^0 = x; x^x = 0;的特点,得出ans[i] = ans[i-1]^encoded[i-1];
java代码:
class Solution {
public int[] decode(int[] encoded, int first) {
int n = encoded.length;
int[] ans = new int[n+1];
ans[0] = first;
for(int i = 1; i <= n; i++) {
ans[i] = encoded[i-1]^ans[i-1];
}
return ans;
}
}
c++代码:
class Solution {
public:
vector<int> decode(vector<int>& encoded, int first) {
int n = encoded.size();
vector<int> ans(n+1);
ans[0] = first;
for(int i = 1; i <= n; i++) {
ans[i] = encoded[i-1]^ans[i-1];
}
return ans;
}
};