acgo题库
  • 首页
  • 题库
  • 学习
  • 竞赛
  • 讨论
  • 排行
  • 团队
  • 备赛专区

    竞赛

    • CSP-J/S
    • 蓝桥杯

    考级

    • GESP
    • CPA
    • 电子学会考级
登录
注册
题目详情提交记录(0)
  • answer

    #include <iostream> #include <vector> #include <queue> #include <set> #include <algorithm> using namespace std; typedef vector<vector<int>> Matrix; Matrix rotateClockwise(const Matrix& mat) { Matrix result(3, vector<int>(3)); for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) { result[j][2 - i] = mat[i][j]; } } return result; } Matrix rotateCounterclockwise(const Matrix& mat) { Matrix result(3, vector<int>(3)); for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) { result[2 - j][i] = mat[i][j]; } } return result; } Matrix flipHorizontal(const Matrix& mat) { Matrix result(3, vector<int>(3)); for (int i = 0; i < 3; ++i) { result[i] = mat[i]; reverse(result[i].begin(), result[i].end()); } return result; } Matrix flipVertical(const Matrix& mat) { Matrix result(3, vector<int>(3)); for (int i = 0; i < 3; ++i) { result[i] = mat[2 - i]; } return result; } string matrixToString(const Matrix& mat) { string s; for (const auto& row : mat) { for (int val : row) { s += to_string(val) + ","; } } return s; } int main() { Matrix start(3, vector<int>(3)); Matrix target(3, vector<int>(3)); }

    userId_undefined

    187****9555

    2阅读
    0回复
    0点赞
暂无数据

提交答案之后,这里将显示提交结果~

首页