CCF201412-2 Z字形扫描

方法一：很长：

#include <iostream>

using namespace std;

const int N = 1000;
int a[N];

int main()
{
   int n,m,res = 0,i,j,tmp,x,y;
   n = 4;
   int aa[n][n] = { {1,5 ,3 ,9},{3, 7 ,5 ,6},{9,4 ,6 ,4},{7 ,3 ,1 ,3}};

   //int aa[n][n] = { {1,5 ,3 ,9},{3, 7 ,5 ,6},{　9 ,4 ,6 ,4},{　7 ,3 ,1 ,3} };
  /* cin >> n;
  for(i =  0;i < n;i++)
    for(j = 0;j < n;j++)
        cin >> aa[i][j];*/
  for(i = 1;i <= 2 * n - 1;i++){
    if(i % 2== 0){
        if(i <= n){
            for(x = 0,y = i - 1;y >= 0  && x < n;y--,x++)
                cout<<aa[x][y]<<" ";
        }else{
            for(x = i - n,y = n -1;y >= 0  &&x < n;y--,x++)
                cout<<aa[x][y]<<" ";
        }
    }else{
        if(i <= n){
            for(x = i - 1,y = 0;x >= 0 && y < n;y++,x--)
                cout<<aa[x][y]<<" ";
        }else{
        for(x = n - 1,y = i - n;x >= 0 && y < n;y++,x--)
                cout<<aa[x][y]<<" ";
        }
    }
  }




	return 0;

}

方法二：

#include <iostream>

using namespace std;

const int N = 1000;
int a[N];

int main()
{
   int n,m,res = 0,i,j,tmp,x,y;
   n = 4;
   int aa[n][n] = { {1,5 ,3 ,9},{3, 7 ,5 ,6},{9,4 ,6 ,4},{7 ,3 ,1 ,3}};

   //int aa[n][n] = { {1,5 ,3 ,9},{3, 7 ,5 ,6},{　9 ,4 ,6 ,4},{　7 ,3 ,1 ,3} };
  /* cin >> n;
  for(i =  0;i < n;i++)
    for(j = 0;j < n;j++)
        cin >> aa[i][j];*/
  for(i = 1;i <= 2 * n - 1;i++){
        int x,y,nn = i > n? 2*n -i:i;
        if(i % 2 == 1){
            x = i > n? n - 1: i - 1;
            y = i > n? i - n:0;

            for(int j = 0;j < nn;j++)
                cout << aa[x - j][y + j] << " ";
        }else{
            x = i > n? i - n: 0;
            y = i > n? n - 1:i - 1;
            for(int j = 0;j < nn;j++)
                cout << aa[x + j][y - j] << " ";
        }
  }



	return 0;

}

错误版本：错在输出时，用了双重循环。这样导致输出时不是按照斜线输出的而是方块形。

#include <iostream>


using namespace std;
 const int N = 501;
 int a[N][N];
int main()
{
    int i,j,k,n;
    cin >> n;
    for(i = 0;i < n;i++)
        for(j = 0;j < n;j++)
          cin >> a[i][j];
    for(i = 1;i <= 2*n - 1;i++){
        if(i % 2 == 1){
            j = i < n ? i -1:n-1;
            k = i < n ? 0 : i - n;
            for(;j >= 0;j--)
                for(;k < n;k++)
                    cout <<"i为" << i<< "第" << j << "行" << " " << k << "列" <<a[j][k] << endl;
        }else{
            j = i < n ? 0 : i - n;
            k = i < n?  i - 1 :n - 1;
            for(;j < n;j++)
                for(;k >= 0;k--)
                    cout <<"i为" << i<< "第" << j << "行" << " " << k << "列" << a[j][k] << endl;
        }
    }
    return 0;
}