본문 바로가기
HackerRank Algorithm

[HackerRank] 15. Diagonal Difference

by KIha_Jung 2020. 3. 9.

def diagonalDifference(arr):
    diagonal_sum_r = 0
    diagonal_sum_l = 0
    max_len = len(arr)

    for i in range(max_len):
        diagonal_sum_r += arr[i][i]
        diagonal_sum_l += arr[i][(max_len - 1) -i]
    return abs(diagonal_sum_r - diagonal_sum_l)

if __name__ == '__main__':
    n = int(input().strip())
    arr = []
    for _ in range(n):
        arr.append(list(map(int, input().rstrip().split())))

    result = diagonalDifference(arr)
    print(result)

댓글