Scribd Logo
Upload

Welcome to Scribd!

  • Find Intersection Intervals JAVA

    Uploaded by

    Prabu
    4 views1 page
    This Java code finds the intersection of intervals defined in a 2D array. It takes the first interval as the initial intersection range, then iterates through the remaining intervals to update the intersection range by taking the maximum of the left bounds and minimum of the right bounds. After checking all intervals, it prints the final intersection range, or -1 if no intersection exists. The main method tests it on a sample 2D array of intervals.

    Original Description:

    kjnlanll pahlahl aliahlhal ali alhalh all ahl a alhalh alhalhal lah l

    Original Title

    Find intersection intervals JAVA

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Java code finds the intersection of intervals defined in a 2D array. It takes the first interval as the initial intersection range, then iterates through the remaining intervals to update the intersection range by taking the maximum of the left bounds and minimum of the right bounds. After checking all intervals, it prints the final intersection range, or -1 if no intersection exists. The main method tests it on a sample 2D array of intervals.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Find Intersection Intervals JAVA

    Uploaded by

    Prabu
    This Java code finds the intersection of intervals defined in a 2D array. It takes the first interval as the initial intersection range, then iterates through the remaining intervals to update the intersection range by taking the maximum of the left bounds and minimum of the right bounds. After checking all intervals, it prints the final intersection range, or -1 if no intersection exists. The main method tests it on a sample 2D array of intervals.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Java implementation of the approach

    import java.io.;

    class GFG
    {

    Function to print the intersection


    static void findIntersection(int intervals[][], int N)
    {
    First interval
    int l = intervals[0][0];
    int r = intervals[0][1];

    Check rest of the intervals


    and find the intersection
    for (int i = 1; i N; i++)
    {

    If no intersection exists
    if (intervals[i][0] r
    intervals[i][1] l)
    {
    System.out.println(-1);
    return;
    }

    Else update the intersection


    else
    {
    l = Math.max(l, intervals[i][0]);
    r = Math.min(r, intervals[i][1]);
    }
    }
    System.out.println ([ + l +, + r + ]);
    }

    Driver code
    public static void main (String[] args)
    {

    int intervals[][] = {{ 1, 6 },
    { 2, 8 },
    { 3, 10 },
    { 5, 8 }};
    int N = intervals.length;
    findIntersection(intervals, N);
    }
    }

    This Code is contributed by ajit..

    You might also like