智能仓库货架库存整理的C++实现

```cpp #include <iostream> #include <vector> using namespace std; // 整理货架函数 vector<vector<int>> organizeShelf(int m, int n, vector<vector<int>>& inventory) { vector<int> nonZeroItems; // 遍历货架，将非零库存添加到 nonZeroItems 中 for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { if (inventory[i][j] != 0) { nonZeroItems.push_back(inventory[i][j]); } } } // 创建一个新的矩阵来存储整理后的货架 vector<vector<int>> organized(m, vector<int>(n, 0)); int index = 0; // 将非零库存按原始相对顺序填充到新矩阵的靠前位置 for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { if (index < nonZeroItems.size()) { organized[i][j] = nonZeroItems[index]; index++; } } } return organized; } int main() { int m, n; cin >> m >> n; vector<vector<int>> inventory(m, vector<int>(n)); // 读取输入的货架库存信息 for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { cin >> inventory[i][j]; } } // 调用整理货架函数 vector<vector<int>> organized = organizeShelf(m, n, inventory); // 输出整理后的货架矩阵 for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { cout << organized[i][j]; if (j < n - 1) { cout << " "; } } cout << endl; } return 0; } ``` ######[AI问答 | 519点数解答 | 2026-03-08 10:31:34]