g1501_1600.s1550_three_consecutive_odds.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1501_1600.s1550_three_consecutive_odds;

// #Easy #Array #2022_04_11_Time_0_ms_(100.00%)_Space_43.3_MB_(21.06%)

/**
 * 1550 - Three Consecutive Odds\.
 *
 * Easy
 *
 * 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`
**/
public class Solution {
    public boolean threeConsecutiveOdds(int[] arr) {
        for (int i = 0; i < arr.length - 2; i++) {
            if (arr[i] % 2 == 1 && arr[i + 1] % 2 == 1 && arr[i + 2] % 2 == 1) {
                return true;
            }
        }
        return false;
    }
}