帮我写一下class ThistlethwaiteSolver 中实现完成顶层十字的逻辑部分的代码要使得写出来的代码能够直接放进原来的代码中使用#include iostream#include vector#include stringusing namespace std; 定义魔方的颜色enum Color RED BLUE GREEN WHITE YELLOW ORANGE ; 定义魔方

// 第一步：完成顶层十字 void completeTopCross(Cube& cube) { // 获取当前魔方状态 CubeState state = cube.getState();

// 判断顶层是否已经完成十字
if (state.up[0][1] == YELLOW && state.up[1][0] == YELLOW && state.up[1][2] == YELLOW && state.up[2][1] == YELLOW) {
	cout << "顶层十字已完成" << endl;
	return;
}

// 如果顶层没有完成十字，则进行以下操作
// 先将顶层中心块的颜色调整为黄色
while (state.up[1][1] != YELLOW) {
	cube.rotate(UP, CLOCKWISE);
	state = cube.getState();
}

// 将四个棱块调整到正确的位置
// 找到白色棱块所在的面和位置
Color color1 = state.front[0][1];
int row1, col1;
if (state.up[0][1] == color1) {
	row1 = 0;
	col1 = 1;
} else if (state.up[1][0] == color1) {
	row1 = 1;
	col1 = 0;
} else if (state.up[1][2] == color1) {
	row1 = 1;
	col1 = 2;
} else {
	row1 = 2;
	col1 = 1;
}

// 找到另一个与白色棱块相邻的棱块所在的面和位置
Color color2;
if (row1 == 0 && col1 == 1) {
	color2 = state.back[0][1];
} else if (row1 == 1 && col1 == 0) {
	color2 = state.left[1][2];
} else if (row1 == 1 && col1 == 2) {
	color2 = state.right[1][0];
} else {
	color2 = state.front[2][1];
}
int row2, col2;
if (state.up[0][1] == color2) {
	row2 = 0;
	col2 = 1;
} else if (state.up[1][0] == color2) {
	row2 = 1;
	col2 = 0;
} else if (state.up[1][2] == color2) {
	row2 = 1;
	col2 = 2;
} else {
	row2 = 2;
	col2 = 1;
}

// 调整棱块的位置
while (state.front[0][1] != color1) {
	cube.rotate(UP, CLOCKWISE);
	state = cube.getState();
}
while (state.up[0][1] != color1) {
	cube.rotate(FRONT, CLOCKWISE);
	state = cube.getState();
}
while (state.front[0][1] != color2) {
	cube.rotate(UP, CLOCKWISE);
	state = cube.getState();
}
while (state.up[0][1] != color2) {
	cube.rotate(FRONT, COUNTERCLOCKWISE);
	state = cube.getState();
}

// 调整棱块的朝向
if (state.front[0][1] == color1 && state.up[0][1] == color2) {
	cube.rotate(FRONT, CLOCKWISE);
	cube.rotate(UP, CLOCKWISE);
	cube.rotate(RIGHT, CLOCKWISE);
	cube.rotate(UP, COUNTERCLOCKWISE);
	cube.rotate(RIGHT, COUNTERCLOCKWISE);
	cube.rotate(FRONT, COUNTERCLOCKWISE);
} else {
	cube.rotate(FRONT, COUNTERCLOCKWISE);
	cube.rotate(UP, CLOCKWISE);
	cube.rotate(RIGHT, CLOCKWISE);
	cube.rotate(UP, COUNTERCLOCKWISE);
	cube.rotate(RIGHT, COUNTERCLOCKWISE);
	cube.rotate(FRONT, CLOCKWISE);
}

// 递归调用函数，直到顶层完成十字
completeTopCross(cube);

}