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

  • Puneet3821 + 3 comments

    no need to use extra for loop.

    for(int a_i = 0;a_i < n;a_i++){
       for(int a_j = 0;a_j < n;a_j++){
          cin >> a[a_i][a_j];
       }
        d1 = d1 + a[a_i][a_i];
        d2 = d2 + a[a_i][n-1-a_i];
    }
    • honeyd725 + 1 comment

      is this in java

      • sarinarw + 0 comments

        Yes it is in Java, many other languages have some version of split though. Scala and Python have split() that works in the same way, C has str_tok <- apparently works like split

    • sumit_dutta + 1 comment

      there is a segmentaion fault in your code.

      • ben_nxumalo + 0 comments
        $first = $second=0;
$j = $n-1;
for($i=0;$i<$n; $i++){
    $first +=$a[$i][$i];
    $second +=$a[$i][$j];
    $j--;
} 


$result=  abs($first-$second);
print abs($result);
    • Turings_Ghost + 1 comment

      Slightly cleaner and more readable:

              int diag1 = 0, diag2 = 0;
        for(int p = 0; p<n; p++)
        {
            diag1 += a[p][p];
            diag2 += a[p][n - (p + 1)];
        }
      • prachigoel1598 + 1 comment

        can u please explain why n-j-1...

        • post4visakhvspm + 0 comments

          because n will be length and always +1 than index