LeetCode_2024/December/LC2762.java at main · DevendraCollage/LeetCode_2024 · GitHub

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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
 * LC2762
 */

import java.util.Scanner;

public class LC2762 {
    public static long continuousSubarrays(int[] nums) {
        int n = nums.length;
        int left = 0;
        int rangeMin = nums[0];
        int rangeMax = nums[0];

        long count = 0;
        long winSize;
        int right;

        for (right = 0; right < n; right++) {
            rangeMin = Math.min(rangeMin, nums[right]);
            rangeMax = Math.max(rangeMax, nums[right]);

            if (rangeMax - rangeMin > 2) {
                winSize = right - left;
                count += (winSize * (winSize + 1)) / 2;

                left = right;
                // Expand current window to as left as possible
                rangeMin = nums[right];
                rangeMax = nums[right];
                while (left > 0 && Math.abs(nums[right] - nums[left - 1]) <= 2) {
                    left--;
                    rangeMin = Math.min(rangeMin, nums[left]);
                    rangeMax = Math.max(rangeMax, nums[left]);
                }
                // Subtract overcounted subarrays
                if (left < right) {
                    winSize = right - left;
                    count -= (winSize * (winSize + 1)) / 2;
                }
            }
        }
        // Add subarrays from the last window
        winSize = right - left;
        count += (winSize * (winSize + 1)) / 2;

        return count;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        System.out.print("Enter The Nums Array Length : ");
        int n = sc.nextInt();
        System.out.println();

        int[] nums = new int[n];

        System.out.println("Enter The Nums Array Elements : ");
        for (int i = 0; i < nums.length; i++) {
            System.out.printf("[%d] : ", i);
            nums[i] = sc.nextInt();
        }
        System.out.println();

        long ans = continuousSubarrays(nums);

        System.out.println(ans);

        sc.close();
    }
}