LeetCode-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.

Constraints:
• 1 <= arr.length <= 1000
• 1 <= arr[i] <= 1000

Example

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.

Submissions

解题思路很简单，初始化一个计数标志count，遍历数组元素，当遍历到第一个奇数是，开始计数，当连续有3个奇数则返回True，否则计数标志重新初始化为0。若遍历结束，没有3个连续奇数则返回False.

实现代码如下：

class Solution:
    def threeConsecutiveOdds(self, arr: List[int]) -> bool:
        count = 0
        for i in arr:
            if i % 2 == 1:
                count += 1
                if count == 3:
                    return True
            else:
                count = 0
        return False