LeetCode题解——删除子文件夹
- 题目介绍
- 解题思路分析
1.暴力解题思路
双重循环,时间复杂度O(n2)
伪代码:
for(i= 0;i<len;i++){
for(j = i;j<len;j++) {
folder[i]与folder[j]比较看folder[i]是不是最上层的文件夹
如果folder[i]是最上层文件夹就保存到结果列表
}
}
2.利用set
现有三个结构,set存放所有的folder数据,两个vector容器,分别是原始folder,另一个是结果res
遍历folder,以‘/’为分界线查看是否有上层文件夹存在与map中,代码如下:
#include<iostream>
using namespace std;
#include<vector>
#include<set>
class Solution {
public:
vector<string> removeSubfolders(vector<string>& folder) {
set<string> s;
vector<string> res;
for(auto& x:folder) { //将数据存放到set中
s.insert(x);
}
for(auto & x:folder) {
bool flag = true;
int pos = 0;
int len = x.length();
if(1 == len) { //踢出‘/’这种情况
continue;
}
while((pos = x.find('/',pos+1)) != string::npos) {
if(s.find(x.substr(0,pos)) != s.end()) { //说明是一个子文件夹
flag = false;
}
}
if(true == flag) {
res.insert(res.end(),x); //flag没有变,说明不是子文件夹存入结果vector
}
}
return res;
}
};
//["/a","/a/b","/c/d","/c/d/e","/c/f"]
int main() {
Solution s;
vector<string> tag = {"/a","/a/b","/c/d","/c/d/e","/c/f"};
vector<string> out = s.removeSubfolders(tag);
for(auto it:out) {
cout << it<<endl;
}
}
这种情况也不是很好,首先set插入默认是排序的,还有find嵌套,for下面有while,复杂度O(n*字符串长度2*+n)
3.排序后比较
思路分部:
- 先将原有数据排序
- 将每个数据和前一个数据进行比较看是否是子文件夹
例如:排序完是这样的["/a","/a/b","/c/d","/c/d/e","/c/f"]
复杂度:O(nlogn+n)
#include<iostream>
#include<algorithm>
using namespace std;
#include<vector>
#include<set>
class Solution {
public:
vector<string> removeSubfolders(vector<string>& folder) {
vector<string> out;
sort(folder.begin(),folder.end());
string pre="/";
for(auto& x:folder) {
if(!(x.find(pre) == 0 && x[pre.size()]=='/')){ //当pre是当前x字符串的子串,同时pre子串最后一个字符的下一位是'/',
out.emplace_back(x); //那就可以肯定,x是pre的子文件夹,这时取!,那就意味着x不是子文件夹
pre = x;
}
}
return out;
}
};
//["/a","/a/b","/c/d","/c/d/e","/c/f"]
int main() {
Solution s;
vector<string> tag = {"/a","/a/b","/c/d","/c/d/e","/c/f"};
vector<string> out = s.removeSubfolders(tag);
for(auto it:out) {
cout << it<<endl;
}
}