snakeShape 蛇形数组

在师兄的督促下实现的蛇性数组,用了最简单的办法,最开始还怀疑能不能实现,结果还真的可以.

// snakeshape.cpp
// input: n
#include<iostream>
using namespace std;

int main() {
  int count = 0;
  int n;
  cout << "please enter the matrix size you want to print: ";
  cin >> n;
  if (n == 1) {
    cout << "(0, 0)" << endl;
    return 0;
  }
  int flag = 1;
  int first_index = 0, second_index = n - 1, third_index = n - 1,
  fourth_index = 0;
  while(count != n*n) {
  //  从左到右
  if (flag == 1) {
    for (int i = first_index; i <= second_index; i++) {
      if (first_index == 0&&i == 0) cout << "(0, 0)";
      else cout << "->(" << first_index << ", " << i << ")";
      count++;
      if (count == n*n) {
        cout << endl;
        return 0;
      }
    }
    first_index++;
    flag = 2;
  }
  //  从上到下
  if (flag == 2) {
    for (int i = first_index; i <= second_index; i++) {
      cout << "->(" << i << ", " << second_index << ")";
      count++;
      if (count == n*n) {
        cout << endl;
        return 0;
      }
    }
    second_index--;
    flag = 3;
  }
  //  从右到左
  if (flag == 3) {
    for (int i = third_index - 1; i >= first_index - 1; i--) {
      cout << "->(" << third_index << ", " << i << ")";
      count++;
      if (count == n*n) {
        cout << endl;
        return 0;
      }
    }
    third_index--;
    flag = 4;
  }
  //  从下到上
  if (flag == 4) {
    for (int i = third_index; i >= first_index; i--) {
      cout << "->(" << i << ", " << fourth_index << ")";
      count++;
      if (count == n*n) {
        cout << endl;
        return 0;
      }
    }
    fourth_index++;
    flag = 1;
  }
  }
  return 0;
}

此处是测试结果:

please enter the matrix size you want to print: 1
(0, 0)

please enter the matrix size you want to print: 2
(0, 0)->(0, 1)->(1, 1)->(1, 0)

please enter the matrix size you want to print: 3
(0, 0)->(0, 1)->(0, 2)->(1, 2)->(2, 2)->(2, 1)->(2, 0)->(1, 0)->(1, 1)

please enter the matrix size you want to print: 4
(0, 0)->(0, 1)->(0, 2)->(0, 3)->(1, 3)->(2, 3)->(3, 3)->(3, 2)->(3, 1)->(3, 0)->(2, 0)->(1, 0)->(1, 1)->(1, 2)->(2, 2)->(2, 1)

please enter the matrix size you want to print: 5
(0, 0)->(0, 1)->(0, 2)->(0, 3)->(0, 4)->(1, 4)->(2, 4)->(3, 4)->(4, 4)->(4, 3)->(4, 2)->(4, 1)->(4, 0)->(3, 0)->(2, 0)->(1, 0)->(1, 1)->(1, 2)->(1, 3)->(2, 3)->(3, 3)->(3, 2)->(3, 1)->(2, 1)->(2, 2)