在这段代码中帮我补全一下代码使得这段代码能够使用Thistlethwaite实现魔方的复原给出完整的case WHITE部分的代码#include iostream#include vector#include stringusing namespace std; 定义魔方的颜色enum Color RED BLUE GREEN WHITE YELLOW ORANGE ; 定义魔方的转动方式en
case WHITE: // 根据旋转方式调整 white 面的状态 for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { temp[i][j] = front[i][j]; } } if (rotation == CLOCKWISE) { for (int i = 0; i < 3; i++) { front[0][i] = left[0][i]; left[0][i] = back[0][i]; back[0][i] = right[0][i]; right[0][i] = temp[0][i]; } for (int i = 0; i < 3; i++) { front[1][i] = left[1][i]; left[1][i] = back[1][i]; back[1][i] = right[1][i]; right[1][i] = temp[1][i]; } for (int i = 0; i < 3; i++) { front[2][i] = left[2][i]; left[2][i] = back[2][i]; back[2][i] = right[2][i]; right[2][i] = temp[2][i]; } for (int i = 0; i < 3; i++) { up[2][i] = up[0][i]; up[0][i] = down[0][i]; down[0][i] = down[2][i]; down[2][i] = up[2][i]; } } else if (rotation == COUNTERCLOCKWISE) { for (int i = 0; i < 3; i++) { front[0][i] = right[0][i]; right[0][i] = back[0][i]; back[0][i] = left[0][i]; left[0][i] = temp[0][i]; } for (int i = 0; i < 3; i++) { front[1][i] = right[1][i]; right[1][i] = back[1][i]; back[1][i] = left[1][i]; left[1][i] = temp[1][i]; } for (int i = 0; i < 3; i++) { front[2][i] = right[2][i]; right[2][i] = back[2][i]; back[2][i] = left[2][
原文地址: https://www.cveoy.top/t/topic/bUgy 著作权归作者所有。请勿转载和采集!