检查数组是否在 C 中镜像

Question

我正在尝试检查用户输入的数组是否被镜像

用户输入：

//for the rows and column
3 3
//elements inside array
1 0 1
2 0 3
4 0 4

输出应该告诉数组的第一个索引和最后一个索引是否相同，但我唯一做的就是镜像它并打印镜像，即使它不一样

int main()
{                       
    int arr[10][10];   
    int col,row;   
 
    scanf("%d %d", &col, &row);    
 
    for (int i = 0; i < col; i++) {
        for (int j = 0; j < row; j++) {
            scanf("%d", &arr[i][j]);
        }
    }       
 
    for (int i = 0; i < col; i++) {
        for(int j = row - 1; j >= 0; j--) {
            printf("Mirror"); 
        }
    }       
} 

数组和元素的大小取决于用户，谢谢你

Answer 1

这是我对您的问题的解决方案，此代码可能有一些问题，但通常按照您的要求进行。适应您的特定需求。

输出：

This program will check if an array is mirrored. Press enter to proceed!
 
Insert row*col -> 3*3
Insert row 1 elements, one by one!
Element 1 -> 1
Element 2 -> 0
Element 3 -> 1
Insert row 2 elements, one by one!
Element 1 -> 2
Element 2 -> 0
Element 3 -> 3
Insert row 3 elements, one by one!
Element 1 -> 4
Element 2 -> 0 
Element 3 -> 4
Mirror found at row 1!
1 0 1 
Mirror found at row 3!
4 0 4 

代码：

#include <stdio.h>

#define MAXCOLUMN 10
#define MAXROW    10

void clean(){
  int temp;
  while ((temp = getchar()) != '\n' && temp != EOF);
}

void print(int dim,int r, int row[][MAXCOLUMN]){
  for(int index = 0; index < dim; index++)
    printf("%d ",row[r][index]);
  putchar('\n');
}

int main(void){
  int arr[MAXROW][MAXCOLUMN];
  int col,row,mirror;

  puts("This program will check if an array is mirrored. Press enter to proceed!");

  do{
    clean();
    printf("Insert row*col -> ");
  } 
  while(scanf("%d*%d", &row, &col)!=2);

  for(int r = 0; r < row; r++){
    printf("Insert row %d elements, one by one!\n",r+1);
    for(int c = 0; c < col; c++){
      do{
        clean();
        printf("Element %d -> ", c+1);
      }while(!scanf("%d",&arr[r][c]));
    }
  }

  for(int r = 0; r < row; r++){
    mirror = 1;
    for(int cFH = 0, cSH = col-1; cFH < col/2; cFH++, cSH--)//cFH -> column index first half | cSH -> column index second half
      if(arr[r][cFH] != arr[r][cSH]){
        mirror = 0;
        break;
      }
    if(mirror){
      printf("Mirror found at row %d!\n",r+1);
      print(col,r,arr);
    }
  }

  return 0;
}

Answer 2

通常您遍历每一行的列，这意味着通常i（外循环）代表行，j 代表列。

这段代码展示了一种检查二维数组是否水平镜像的方法：

int mirror = 1;

for(int i = 0; i < row; i++) {
    
    for(int j = 0; j < col/2; j++) {
        
        // comparing first element with last element of row `i`
        // than comparing the second element with the second last
        // and so on, till you reach the center of the row, `j==col/2`
        // if the comparison is true just one time, the array is not mirrored
        if( array[i][j] != array[i][col-j-1] ) { 
            
            mirror = 0;
            i = row; // to break the outer loop
            break;
        }                  
    }                                    
}                                                        

mirror ? puts("Mirror!") : puts("No mirror.");

在程序结束时，如果变量mirror 的值仍然是1，则得到一个镜像数组。