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. Prepare
  2. Algorithms
  3. Warmup
  4. Diagonal Difference
  5. Discussions

Diagonal Difference

  • jesus_rpalos
     + 0 comments

    Mine followed a similar logic, but you don't actually have to use two for loops. You already know the relationship between j and k, so you can use just one for loop to increment j.

    int rightD = 0;
        int leftD = 0;
        for(int i = 0; i < n; i++){
            leftD += a[i][i];
            rightD += a[i][n-i-1];
        }
        System.out.println(Math.abs(leftD - rightD));