001-algorithm-print matrix on the clockwise

1 2 3

4 5 6   ---> 1 2 3 6 9 8 7 4 5

7 8 9   


void print_matrix(int a[], int m, int n)
{
	//matrix a with size m n
	std::vector<int> x;
	int point1 = 0;
	int point2 = n - 1;
	int point3 = m*n - 1;
	int point4 = m*n - n;
	while (point1<=point2 && point2<=point3 && point3>=point4 && point4>=point1)
	{
		for (int i = point1; i < point2; i++){
			x.push_back(a[i]);
		}
		for (int i = point2; i < point3; i += n){
			x.push_back(a[i]);
		}
		for (int i = point3; i > point4; i--){
			x.push_back(a[i]);
		}
		for (int i = point4; i > point1; i -= n){
			x.push_back(a[i]);
		}
		if (point1 == point2 && point3 == point4 && point1==point3){
			x.push_back(a[point1]);
		}
		point1 += (n + 1);
		point2 += (n - 1);
		point3 -= (n + 1);
		point4 -= (n - 1);
	}//while
	for (auto i : x){
		std::cout << i << " ";
	}
}


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值