Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- struct trie{
- unordered_map<string,struct trie*> children;
- bool isEnd;
- };
- struct trie* getNode(){
- struct trie* node=new trie;
- node->children.clear();
- node->isEnd=false;
- return node;
- }
- void insert(struct trie* root,vector<string>& v){
- struct trie* ptr=root;
- for(int i=0;i<v.size();i++){
- if(ptr->children.count(v[i])){
- ptr->children[v[i]]=getNode();
- ptr=ptr->children[v[i]];
- }
- ptr=ptr->children[v[i]];
- }
- ptr->isEnd=true;
- }
- bool isSame(struct trie* node1,struct trie* node2){
- if((node1->children.size()==0)&&(node2->children.size()==0)&&(node1->isEnd==node2->isEnd)){
- return true;
- }
- if(node1->children.size()!=node2->children.size()){
- return false;
- }
- bool ans=true;
- for(auto iter:node1->children){
- if(node2->children.count(iter.first)==0){
- return false;
- }else{
- ans=ans&isSame(iter.second,node2->children[iter.first]);
- }
- }
- return ans;
- }
- vector<vector<string>> all(struct trie* root){
- for(auto iter:root->children){
- cout<<iter.first<<' ';
- all(iter.second);
- }
- return {};
- }
- vector<vector<string>> deleteDuplicateFolder(vector<vector<string>>& paths) {
- struct trie* root=getNode();
- vector<vector<string>> ans;
- for(auto iter:paths){
- insert(root,iter);
- }
- all(root);
- return ans;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement