Last active
August 26, 2021 22:05
-
-
Save Edmartt/413c1ffccece501fbfcbabd87e14ca0f to your computer and use it in GitHub Desktop.
find diagonal difference
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
int diagonalDifference(int arr[3][3]); | |
int main(int argc, char* argv[]){ | |
int arr[3][3] ={{1,2,3}, {4,5,6},{7,8,9}}; | |
printf("Resultado: %d\n", diagonalDifference(arr)); | |
return 0; | |
} | |
int diagonalDifference(int arr[3][3]){ | |
int diag1=0, diag2=0; | |
for (int i=0; i < 3; i++) { | |
if (i==0){ | |
diag1+=arr[i][i]; | |
} | |
if (i==1){ | |
diag1+=arr[i][i]; | |
} | |
if (i==2){ | |
diag1+=arr[i][i]; | |
} | |
} | |
for (int i=2; i >= 0; i--) { | |
if (i==2){ | |
diag2+=arr[i][i-i]; | |
} | |
if (i==1){ | |
diag2+=arr[i][i]; | |
} | |
if (i==0){ | |
diag2+=arr[i][i+2]; | |
} | |
} | |
int result=diag1-diag2; | |
return result; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Otro tipo de solución:
Para recorrer la diagonal P.
i
incrementa yj
incrementa, daría este resultado:Para recorrer la 2do diagonal,
i
incrementa yj
decrementa, daría este resultado:Para hacer todo dinámico, se lo puede hacer así: