Given an array nums of length n, return an array answer of length n - 1 such that answer[i] = nums[i] | nums[i + 1] where | is the bitwise OR operation.
classSolution {
publicint[]orOfAdjacent(int[] nums) {
int n = nums.length;
int[] ans =newint[n-1];
for (int i = 0; i < n-1; ++i) ans[i]= nums[i]| nums[i+1];
return ans;
}
}
1
2
3
4
5
6
7
8
classSolution {
funorOfAdjacent(nums: IntArray): IntArray {
val n = nums.size
val ans = IntArray(n-1)
for (i in0 until n-1) ans[i] = nums[i] or nums[i+1]
return ans
}
}
1
2
3
4
5
classSolution:
deforOfAdjacent(self, nums: list[int]) -> list[int]:
n = len(nums)
ans = [nums[i] | nums[i+1] for i in range(n-1)]
return ans