/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
class Solution {
    public Interval[] intervalIntersection(Interval[] A, Interval[] B) {
        List<Interval> ans = new ArrayList<>();
        for (int i = 0, j = 0; i < A.length && j < B.length;) {
            int start = Math.max(A[i].start, B[j].start);
            int end = Math.min(A[i].end, B[j].end);
            if (start <= end) {
                ans.add(new Interval(start, end));
            }
            if (A[i].end <= B[j].end) {
                i++;
            } else {
                j++;
            }
        }
        Interval[] x = new Interval[ans.size()];
        for (int i = 0; i < x.length; i++) x[i] = ans.get(i);
        return x;
    }
}