顺序数字矩阵算法

最新推荐文章于 2022-07-23 10:41:35 发布

xiayu0912

最新推荐文章于 2022-07-23 10:41:35 发布

阅读量908

点赞数

文章标签：算法 debugging input layer

本文链接：https://blog.csdn.net/xiayu0912/article/details/6200858

版权

1----2-----3

| | |

8----9-----4

| | |

7----6-----5

示例：

Input edge length, row and column:3 3 1
The number is 7
Input edge length, row and column:3 2 3
The number is 4

代码：

#include <stdio.h>
#define DEBUG_ENABLE 0

#if DEBUG_ENABLE
# define PDEBUG(fmt, args...) fprintf(stderr, fmt, ## args)
#else
# define PDEBUG(fmt, args...) /* not debugging: nothing */
#endif

#define NumberAtLeftColumn 1
#define NumberAtRightColumn 2
#define NumberAtUpRow 3
#define NumberAtBottomRow 4

int middleLayer;
int whichLineNumberAt;

int getLayer(const int edgeLength, const int row, const int column)
{
int actualLayer, positiveRow, positiveColumn;
middleLayer = edgeLength/2 + edgeLength%2;
positiveRow = row;
positiveColumn = column;
if(row > middleLayer){
positiveRow = edgeLength - row + 1;
}

if(column > middleLayer){
positiveColumn = edgeLength - column + 1;
}

if(positiveRow > positiveColumn){
  whichLineNumberAt = (column > middleLayer) ? NumberAtRightColumn : NumberAtLeftColumn;
  return positiveColumn;
}
else{
  whichLineNumberAt = (row > middleLayer) ? NumberAtBottomRow : NumberAtUpRow ;
  return positiveRow;
}

}

int getNumber(int edgeLength, int outerLayer)
{
return outerLayer * (edgeLength - outerLayer) * 4;
}

int innerNumber(int edgeLength, int row, int column, int actualLayer)
{
int currentLayerEdgeLength;
currentLayerEdgeLength = edgeLength - 2 * actualLayer + 1;
PDEBUG("The whichLineNumberAt = %d currentLayerEdgeLength = %d/n", whichLineNumberAt, currentLayerEdgeLength);
switch(whichLineNumberAt)
{
  case NumberAtLeftColumn:
   return 4 * currentLayerEdgeLength + 1 - (row - actualLayer);
  case NumberAtRightColumn:
   return currentLayerEdgeLength + (row - actualLayer + 1);
  case NumberAtUpRow:
   return column - (actualLayer - 1);
  case NumberAtBottomRow:
   return 3 * currentLayerEdgeLength + 2 - (column - actualLayer + 1);
}
}

int main()
{
int edgeLength = 1, row, column, layerIndex, lastLayerNumber;
while(1){
printf("Input edge length, row and column:");
scanf("%d%d%d", &edgeLength, &row, &column);
if((edgeLength%2) && (row == column) && (row == (edgeLength/2 + edgeLength%2))){
printf("The number is %d/n", getNumber(edgeLength, row - 1) + 1);
return 0;
}

layerIndex = getLayer(edgeLength, row, column);
PDEBUG("The index of actual layer is %d/n", layerIndex);
lastLayerNumber = getNumber(edgeLength, layerIndex - 1);
PDEBUG("The last layer sum is %d/n", lastLayerNumber);
//get the final number
lastLayerNumber += innerNumber(edgeLength, row , column, layerIndex);
printf("The number is %d/n", lastLayerNumber);
}
return 0;
}