1 Star 0 Fork 0

xiangxiang/LeetCode-NOTES

Create your Gitee Account
Explore and code with more than 13.5 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
solution.cpp 361 Bytes
Copy Edit Raw Blame History
默然 authored 7 years ago . update all algorithms.
class Solution
{
public:
int kthSmallest(vector<vector<int>>& matrix, int k)
{
vector<int> vec(matrix.size()*matrix[0].size());
for(int i=0;i<matrix.size();i++)
for(int j=0;j<matrix[0].size();j++)
vec[i*matrix[0].size()+j]=matrix[i][j];
sort(vec.begin(),vec.end());
return vec[k-1];
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiangxiang920/LeetCode-NOTES.git
git@gitee.com:xiangxiang920/LeetCode-NOTES.git
xiangxiang920
LeetCode-NOTES
LeetCode-NOTES
master

Search