查找数组中所有元素的XOR

给定包含大小为N的整数的数组arr [] ，任务是查找此数组的XOR。
例子：

Input: arr[] = {2, 4, 7} 
Output: 1 
Explanation: 
XOR of the array = 2 ^ 4 ^ 7 = 1
Input: arr[] = { 3, 9, 12, 13, 15 } 
Output: 4 
 

方法：为了找到数组中所有元素的XOR，我们简单地遍历数组并使用‘^’运算符找到XOR。因此，请按照以下步骤计算答案：

1. 创建一个变量来存储数组的XOR结果。
2. 对于数组中的每个元素，使用’^’运算符找到元素与结果变量的XOR。
3. 最后，结果变量存储数组中所有元素的XOR。

下面是上述方法的实现：

CPP

// C++ program to find the XOR of
// all elements in the array
 
#include 
using namespace std;
 
// Function to find the XOR of
// all elements in the array
int xorOfArray(int arr[], int n)
{
    // Resultant variable
    int xor_arr = 0;
 
    // Iterating through every element in
    // the array
    for (int i = 0; i < n; i++) {
 
        // Find XOR with the result
        xor_arr = xor_arr ^ arr[i];
    }
 
    // Return the XOR
    return xor_arr;
}
 
// Driver Code
int main()
{
 
    int arr[] = { 3, 9, 12, 13, 15 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    // Function call
    cout << xorOfArray(arr, n) << endl;
 
    return 0;
}

Java

// Java program to find the XOR of
// all elements in the array
class GFG {
     
    // Function to find the XOR of
    // all elements in the array
    static int xorOfArray(int arr[], int n)
    {
        // Resultant variable
        int xor_arr = 0;
     
        // Iterating through every element in
        // the array
        for (int i = 0; i < n; i++) {
     
            // Find XOR with the result
            xor_arr = xor_arr ^ arr[i];
        }
     
        // Return the XOR
        return xor_arr;
    }
     
    // Driver Code
    public static void main (String[] args)
    {
     
        int arr[] = { 3, 9, 12, 13, 15 };
        int n = arr.length;
     
        // Function call
        System.out.println(xorOfArray(arr, n));
 
    }
}
 
// This code is contributed by Yash_R

Python3

# Python3 program to find the XOR of
# all elements in the array
 
# Function to find the XOR of
# all elements in the array
def xorOfArray(arr, n):
 
    # Resultant variable
    xor_arr = 0
 
    # Iterating through every element in
    # the array
    for i in range(n):
 
        # Find XOR with the result
        xor_arr = xor_arr ^ arr[i]
 
    # Return the XOR
    return xor_arr
 
# Driver Code
if __name__ == '__main__':
    arr = [3, 9, 12, 13, 15]
    n = len(arr)
 
    # Function call
    print(xorOfArray(arr, n))
 
# This code is contributed by mohit kumar 29

C#

// C# program to find the XOR of
// all elements in the array
using System;
 
class GFG {
     
    // Function to find the XOR of
    // all elements in the array
    static int xorOfArray(int []arr, int n)
    {
        // Resultant variable
        int xor_arr = 0;
     
        // Iterating through every element in
        // the array
        for (int i = 0; i < n; i++) {
     
            // Find XOR with the result
            xor_arr = xor_arr ^ arr[i];
        }
     
        // Return the XOR
        return xor_arr;
    }
     
    // Driver Code
    public static void Main (string[] args)
    {
     
        int []arr = { 3, 9, 12, 13, 15 };
        int n = arr.Length;
     
        // Function call
        Console.WriteLine(xorOfArray(arr, n));
    }
}
 
// This code is contributed by AnkitRai01

Javascript

 
// JavaScript program to find the XOR of
// all elements in the array
 
// Function to find the XOR of
// all elements in the array
function xorOfArray(arr, n)
{
    // Resultant variable
    let xor_arr = 0;
 
    // Iterating through every element in
    // the array
    for (let i = 0; i < n; i++) {
 
        // Find XOR with the result
        xor_arr = xor_arr ^ arr[i];
    }
 
    // Return the XOR
    return xor_arr;
}
 
// Driver Code
    let arr = [ 3, 9, 12, 13, 15 ];
    let n = arr.length;
 
    // Function call
    document.write(xorOfArray(arr, n) + "<br>");
 
// This code is contributed by Surbhi Tyagi.
 

输出：

4

时间复杂度： O(N) ，其中N是数组的大小。