i]; } for (int i = 0; i < 3; i++) { up[2][i] = up[2][i]; up[1][i] = up[1][i]; up[0][i] = up[0][i]; } } else if (rotation == DOUBLE) { for (int i = 0; i < 3; i++) { front[0][i] = back[0][i]; back[0][i] = temp[0][i]; left[0][i] = right[0][i]; right[0][i] = temp[1][i]; } for (int i = 0; i < 3; i++) { front[1][i] = back[1][i]; back[1][i] = temp[1][i]; left[1][i] = right[1][i]; right[1][i] = temp[2][i]; } for (int i = 0; i < 3; i++) { front[2][i] = back[2][i]; back[2][i] = temp[2][i]; left[2][i] = right[2][i]; right[2][i] = temp[3][i]; } for (int i = 0; i < 3; i++) { up[2][i] = up[2][i]; up[1][i] = up[1][i]; up[0][i] = up[0][i]; } } break;

补全之后的代码这段代码是使用Thistlethwaite实现魔方的复原case WHITE 根据旋转方式调整 white 面的状态 for int i = 0; i 3; i++ for int j = 0; j 3; j++ tempij = frontij; if rotation == CLOCKWISE

原文地址: https://www.cveoy.top/t/topic/bUjI 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录