Diagonal Difference

  • + 3 comments

    Complexity O(N). One Loop.

    static int diagonalDifference(int[][] a) {
            int row=0;
            int column=a[0].length - 1;
            int solution = 0;
            for(int index=0;index<a.length;index++){
                solution -= a[row][row] - a[row++][column--];
            }
            return Math.abs(solution);
        }