我的移动算法无法正常工作

Question

经过大量的修改后，我认为我确定了我的问题，即我的球员在场地上的动作不正确：

 for (t = 1; t <= ROUNDS; t++){
      if (t % 10 == 0) {
      print_game (field);
     }
     if (teamsize > 1){

        for (m = 0; m < SIZE_TEAM; m++){
        if (team [m].presence == 1){
          if (team [m].direction == East){
             if (team [m].y == 24){
              if (field [team [m].x][team [m].y - 1] != 0){
                 rem (field [team [m].x][team [m].y - 1], teamsize);
                 field [team [m].x][team [m].y - 1] = team [m].id;
                 teamsize--;
                 }
                 else {
                 field [team [m].x][team [m].y - 1] = team [m].id;
                 }
                 }

              if (field [team [m].x][team [m].y + 1] != 0) {
                 rem (field [team [m].x][team [m].y + 1], teamsize);
                 field [team [m].x][team [m].y + 1] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x][team [m].y + 1] = team [m].id;
                 }
                 field [team [m].x][team [m].y] = 0;
              }
           else if (team [i].direction == West){
             if (team [m].y == 0){
              if (field [team [m].x][team [m].y + 1] != 0){
                 rem (field [team [m].x][team [m].y + 1], teamsize);
                 field [team [m].x][team [m].y + 1] = team [m].id;
                 teamsize--;
                 }
                 else {
                 field [team [m].x][team [m].y + 1] = team [m].id;
                 }
                }
              if (field [team [m].x][team [m].y - 1] != 0) {
                 rem (field [team [m].x][team [m].y - 1], teamsize);
                 field [team [m].x][team [m].y - 1] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x][team [m].y - 1] = team [m].id;
                 }
 field [team [m].x][team [m].y] = 0;
               }
               else if (team [i].direction == North){
                if (team [m].x == 0){
                  if (field [team [m].x + 1][team [m].y] != 0){
                     rem (field [team [m].x + 1][team [m].y], teamsize);
                     field [team [m].x + 1][team [m].y] = team [m].id;
                     teamsize--;
                     }
                     else {
                     field [team [m].x + 1][team [m].y] = team [m].id;
                 }
              if (field [team [m].x - 1][team [m].y] != 0){
                 rem (field [team [m].x - 1][team [m].y], teamsize);
                 field [team [m].x - 1][team [m].y] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x - 1][team [m].y] = team [m].id;
                 }
              field [team [m].x][team [m].y] = 0;
           }
           else if (team [i].direction == South){
            if (team [m].x == 24){
              if (field [team [m].x - 1][team [m].y] != 0){
                 rem (field [team [m].x - 1][team [m].y], teamsize);
                 field [team [m].x - 1][team [m].y] = team [m].id;
                 teamsize--;
                 }
                 else {
                 field [team [m].x - 1][team [m].y] = team [m].id;
                 }
              if (field [team [m].x + 1][team [m].y] != 0){
                 rem (field [team [m].x + 1][team [m].y], teamsize);
                 field [team [m].x + 1][team [m].y] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x + 1][team [m].y] = team [m].id;
                 }
                  field [team [m].x][team [m].y] = 0;
               }
            }
         }
       }
     }
    }
   }

  print_game (field);
   return 0;
}

我怎么知道 好吧，我测试了部分代码，结果很好。 只有当我包含这个巨大的循环时，事情才会变得复杂。 无论如何，如果您有任何奇怪之处，请告诉我。

另外，这是我的rem函数：

int rem (int id, int teamsize){
   int k;
   for (k = 0; k < teamsize; k++){
      if (team [k].id == id){
         team [k].presence = 0;
      }
   }
}

和我的枚举：

   enum move_direction {East = 1, West = 2, North = 3, South = 4};

Answer 1

通过查看在以下情况下如何在for循环之外声明变量k： for(int k=0;k < teamsize; ++k)我猜您是C的中间用户像我这样的语言。

由于您尚未在此处链接您先前发布的问题，因此我仅在此处严格按照此帖子进行操作。

我的理解是，您在返回结构数据的两个数组（ team和field上遇到了麻烦。

这两个结构是否可能不兼容，甚至更糟糕的非标量数据？

当将team数组编码为二维字段数组时，线性team数组本质上是一个表达式，其结果必须通过求值来获得。 尽管您具有具有返回类型为int的各个结构数据成员，但team数组将必须具有team的struct返回类型，以使这些实例成为team数组的元素。

您可能已经知道，C的数组本质上是一个指向数组中第一个元素的指针。 C语言的这种实现建议两个数组位于两个不同的内存地址空间中。 因此，为了检索字段数组中的数据，编译器将不得不遍历team数组以检索必需的int数据。

仅通过思考过程，就可以合理地假设应该将int值返回到数组位置括号，以便可以访问正确的字段数组元素。 但是，并非一切都在逻辑上起作用。

由于这些非标量数​​据点非常复杂，因此很可能无法编译代码。