12*12 数组各个部分求和
1. 右上半部分
方法一:
for ( int i = 0; i <= 11; i ++ )
for ( int j = i + 1; j <= 11; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if ( i < j )
{
total += kk[i][j];
}
}
2. 左上半部分
方法一
for ( int i = 0; i <= 11; i ++ )
for ( int j = 0; j <= 10 - i; j++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if ( i + j < 11 )
{
total += kk[i][j];
}
}
3.右下半部分
方法一:
for ( int i = 1; i <= 11; i ++ )
for ( int j = 12 - i; j <= 11; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if( i + j > 11)
{
total += kk[i][j];
}
}
4. 左下半部分
方法一:
for ( int i = 0; i < 12; i ++ )
for ( int j = 0; j <= i - 1; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if( i > j )
{
total += kk[i][j];
}
}
5. 上方区域
方法一:
for ( int i = 0; i <= 4; i ++ )
for ( int j = i + 1; j <= 10 - i; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if( i < j && i + j < 11 )
{
total += kk[i][j];
}
}
6. 左方区域
方法一:
for ( int i = 6; i <= 10; i ++ )
for ( int j = 0; j <= 11 - i; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if( i > j && i + j < 11 )
{
total += kk[i][j];
}
}
7. 下方区域
方法一:
for ( int i = 7; i <= 11; i ++ )
for ( int j = 12 - i; j <= i - 1; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j <1 2; j ++ )
{
if( i + j > 11 && i + j < 2 * i )
{
total += kk[i][j];
}
}
8. 右方区域
方法一:
for ( int i = 1; i <= 5; i ++ )
for ( int j = 12 - i; j <= 11; j ++ )
{
total += kk[i][j];
}
for ( int i = 6; i <= 10; i ++ )
for ( int j = i + 1; j <= 11; j ++ )
{
total += kk[i][j];
}
方法二:
for( int i = 0; i < 12; i ++ )
for( int j = 0; j < 12; j ++ )
{
if( i + j > 11 && j > i )
{
total += kk[i][j];
}
}
纯萌新第一次写分享~