连连看(C#版)—第8关图片移动算法

	//第八关图片移动规律
	private void EightPace(int iCurIndex, int iLastIndex)
        {
            int i;
            int j;
            SImageMess SSwap;

            int x = iCurIndex / 18 + 2;
            int y = iCurIndex % 18 + 2;    

            if (iCurIndex / 18 != iLastIndex / 18 || iCurIndex < iLastIndex)
            {
                SSwap = SImage[iCurIndex];
                for (i = iCurIndex; i % 18 - 1 >= 0; i--)
                {
                    SImage[i].ImageNum = SImage[i - 1].ImageNum;
                }
                SImage[i].ImageNum = SSwap.ImageNum;

                SSwap = SImage[iLastIndex];
                for (i = iLastIndex; i % 18 - 1 >= 0; i--)
                {
                    SImage[i].ImageNum = SImage[i - 1].ImageNum;
                }
                SImage[i].ImageNum = SSwap.ImageNum;

                for (j = y; j - 1 >= 2; j--)
                {
                    iMap[x, j] = iMap[x, j - 1];
                }
                iMap[x, j] = 1;

                for (j = iLastIndex % 18 + 2; j - 1 >= 2; j--)
                {
                    iMap[iLastIndex / 18 + 2, j] = iMap[iLastIndex / 18 + 2, j - 1];
                }
                iMap[iLastIndex / 18 + 2, j] = 1;
            }
            else
            {
                SSwap = SImage[iLastIndex];
                for (i = iLastIndex; i % 18 - 1 >= 0; i--)
                {
                    SImage[i].ImageNum = SImage[i - 1].ImageNum;
                }
                SImage[i].ImageNum = SSwap.ImageNum;

                SSwap = SImage[iCurIndex];
                for (i = iCurIndex; i % 18 - 1 >= 0; i--)
                {
                    SImage[i].ImageNum = SImage[i - 1].ImageNum;
                }
                SImage[i].ImageNum = SSwap.ImageNum;

                for (j = iLastIndex % 18 + 2; j - 1 >= 2; j--)
                {
                    iMap[iLastIndex / 18 + 2, j] = iMap[iLastIndex / 18 + 2, j - 1];
                }
                iMap[iLastIndex / 18 + 2, j] = 1;

                for (j = y; j - 1 >= 2; j--)
                {
                    iMap[x, j] = iMap[x, j - 1];
                }
                iMap[x, j] = 1;
            }
        }

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值