-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1486-XOROperationInAnArray.go
More file actions
40 lines (32 loc) · 1.03 KB
/
1486-XOROperationInAnArray.go
File metadata and controls
40 lines (32 loc) · 1.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package main
// 1486. XOR Operation in an Array
// You are given an integer n and an integer start.
// Define an array nums where nums[i] = start + 2 * i (0-indexed) and n == nums.length.
// Return the bitwise XOR of all elements of nums.
// Example 1:
// Input: n = 5, start = 0
// Output: 8
// Explanation: Array nums is equal to [0, 2, 4, 6, 8] where (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8.
// Where "^" corresponds to bitwise XOR operator.
// Example 2:
// Input: n = 4, start = 3
// Output: 8
// Explanation: Array nums is equal to [3, 5, 7, 9] where (3 ^ 5 ^ 7 ^ 9) = 8.
// Constraints:
// 1 <= n <= 1000
// 0 <= start <= 1000
// n == nums.length
import "fmt"
func xorOperation(n int, start int) int {
res := start
for i := 1; i < n ; i++ {
res ^= (start + 2 * i)
}
return res
}
func main() {
// Array nums is equal to [0, 2, 4, 6, 8] where (0 ^ 2 ^ 4 ^ 6 ^ 8) = 8
fmt.Println(xorOperation(5, 0)) // 8
// Array nums is equal to [3, 5, 7, 9] where (3 ^ 5 ^ 7 ^ 9) = 8
fmt.Println(xorOperation(4, 3)) // 8
}