Re: [閒聊] 每日leetcode

作者: enmeitiryous (enmeitiryous)   2024-09-01 08:42:13
今天是easy
題目:
2022. Convert 1D Array Into 2D Array: 給你一個1D vector,數字m,n求將其轉換成
m*n大小的矩陣
思路:
要原本vector長度=m*n才能轉,然後照做即可
vector<vector<int>> construct2DArray(vector<int>& original, int m, int n) {
int tar=m*n;
if(original.size()!=tar){
return {};
}
vector<vector<int>> ans(m,vector<int>());
int cring=0;
for(int i=0;i<m;++i){
for(int j=0;j<n;++j){
ans[i].push_back(original[cring]);
cring++;
}
}
return ans;
}
作者: sustainer123 (caster)   2024-09-01 08:45:00
終於有一天好寫的

Links booklink

Contact Us: admin [ a t ] ucptt.com