![](https://img-blog.csdnimg.cn/4b44775f1eb04d189c883f76c9da61f7.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
算法练习-LeetCode
算法练习-LeetCode 自我练习,每天更新
hslx0
这个作者很懒,什么都没留下…
展开
-
map vector字符串操作
```cpp #include <iostream> #include <string> #include <vector> #include <map> #include<algorithm> using namespace std; class Solution { public: vector<vector<string> > groupAnagrams(vector<string>&.原创 2021-10-14 18:10:14 · 77 阅读 · 0 评论 -
2021-10-14
练习 pow某数据的N次幂 #include <iostream> class Solution { public: double mypow(double x, int n) { double res = 1.0; for (int i = n; i != 0; i /= 2) { if (i % 2 != 0) { res *= x;原创 2021-10-14 15:50:58 · 41 阅读 · 0 评论