Given question and solution in python, please convert the python code to Java code

Problem 194 This problem was asked by Facebook. Suppose you are given two lists of n points, one list p1, p2, ..., pn on the line y = 0 and the other list 91, 92, ..., qn on the line y = 1. Imagine a set of n line segments connecting each point pi to qi. Write an algorithm to determine how many pairs of the line segments intersect. def get_intersections (parr, qarr): segments = list(zip(parr, garr)) count = 0 for i in range(len(segments)): for k in range(i): p1, p2 = segments[i], segments[k] if (p1[0] P2[1]) or (P1[0] > p2[0] and p1[1] P2[1]) or (P1[0] > p2[0] and p1[1]