We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Warmup
  4. Diagonal Difference
  5. Discussions

Diagonal Difference

  • hertze_bogdan + 1 comment

    This is a solution where we go through the matrix only once, no arrays just check if we add the number to one of the diagonals or both.

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        
        int N = in.nextInt();
        int sumA =0, sumB = 0;
        int M = N*N;
        //counter for first diagonal
        int countA = N-N;  // 0   -> N*N  ; step N+1  
        // counte for second diagonal
        int countB = N-1;  // N-1 -> N*N-N; step N-1 
        int countBLimit = M-1; // the last element is not for this diagonal 
        
        for (int i = 0; i<M; i++) {
            int k = in.nextInt();

            if (i == countA) { 
                sumA += k;
                countA += N+1;
            }
            
            if (i == countB && countB < countBLimit) {
               sumB += k;
               countB += N-1;
            }
        }
        System.out.println(Math.abs(sumA-sumB)); 
    }
    • rajarshi356 + 0 comments

      Thnx a lot