230502 테이블 해시 함수

public static int solution(int[][] data, int column, int rowBegin, int rowEnd) {
    column--;
    rowBegin--;

    int finalColumn = column;
    Arrays.sort(data, (o1, o2) -> {
        if (o1[finalColumn] == o2[finalColumn])
            return o2[0] - o1[0];
        return o1[finalColumn] - o2[finalColumn];
    });

    int result = 0;

    for (int i = rowBegin; i < rowEnd; i++) {
        int sumSi = calculateSumSi(data[i], i + 1);
        result ^= sumSi;
    }

    return result;
}

private static int calculateSumSi(int[] row, int rowNumber) {
    int sum = 0;
    for (int i = 0; i < row.length; i++) {
        sum += row[i] % rowNumber;
    }
    return sum;
}

출처:https://school.programmers.co.kr/learn/courses/30/lessons/147354