π―β LeetCode 1550. Three Consecutive Odds | Go
Link ππ» 1550. Three Consecutive Odds
Description
Given an integer array arr
, return true
if there are three consecutive odd numbers in the array. Otherwise, return false
.
Example 1:
- Input:
arr = [2,6,4,1]
- Output:
false
- Explanation:
There are no three consecutive odds.
Example 2:
- Input:
arr = [1,2,34,3,4,5,7,23,12]
- Output:
true
- Explanation:
[5,7,23] are three consecutive odds.
Constraints:
1 <= arr.length <= 1000
1 <= arr[i] <= 1000
Intuition
We have to check if there are βthree consecutive odd numbersβ in the array. We can iterate over the array and check if the current number and the two previous numbers are odd. If they are, we return true
. If we reach the end of the array without finding three consecutive odd numbers, we return false
.
Approach
- Iterate over the array from index
2
tolen(arr)
. - Check if the current number and the two previous numbers are odd. (with bitwise
AND
operation) - Once we find three consecutive odd numbers, return
true
. - If we reach the end of the array without finding three consecutive odd numbers, return
false
.
Complexity
- Time Complexity:
- Space Complexity:
Code
1 | func threeConsecutiveOdds(arr []int) bool { |
Recommendation
Comments