LeetCode 1442. 形成两个异或相等数组的三元组数目 Java

Posted 2023-02-18 oyzg

链接：https://leetcode-cn.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/solution/java-shuang-bai-jie-fa-by-oyzg-t3x0/

解题思路

a==b所以a^b=0 即 arr[i]^…arr[k] = 0;

代码：

class Solution 
    public int countTriplets(int[] arr) 
        int count = 0;
		for(int i = 0; i < arr.length-1; i++) 
			int sum = arr[i];
			for(int j = i+1; j < arr.length; j++) 
				sum ^= arr[j];
				if(sum == 0) 
					count += (j-i);
				
			
		
		return count;