ADSAA

7-4 Document Distance （PAT ADSAA） (24/35)

这道题只拿了24/35分，我猜问题出在stemming函数里，但是暂时不知道该怎么处理。#include#include#include#include#include#include#includeconstintMAXN=100;intN,M,sz,t;charch;doubleresult;std::stringtitle,tmp,a,b;std::maptitleNbr;std::mapw
天天AZ·2023-06-21 19:12

7-2 Color the Tree （PAT ADSAA）

#include#include#include#includestructnode{intkey;intminHeight;intmaxHeight;};intK,N;boolflag;node*root;std::vectorpostorder,inorder;std::mapmp;node*buildTree(intinL,intinR,intpostL,intpostR){if(inL==
天天AZ·2023-06-21 19:11

7-3 Self-printable B+ Tree (PAT ADSAA)

#include#include#include#includestructnode{boolisLeaf;intsize;intkey1;intkey2;intkey3;node*first;node*second;node*third;node*parent;};boolsearch(node*root,intkey){if((root->size>=1&&key==root->key1)||
天天AZ·2023-06-21 05:51

7-5 Werewolf (PAT ADSAA)

#include#include#include#includeintN,M,L;charc;std::vector>claim;std::vectorflag;std::vectorcurr;std::vector>res;booljudge(){intlieWolf=0;intliers=0;for(inti=1;i&a,conststd::vector&b){intsz=a.size()>b
天天AZ·2023-06-21 05:51

7-1 Is It An AVL Tree (PAT ADSAA)

#include#include#includestructnode{intkey;node*leftNode;node*rightNode;intheight;};node*buildTree(std::vectorvec){node*root;root=newnode;root->key=vec[0];autoit=vec.begin()+1;if(it==vec.end()){root->l
天天AZ·2023-06-21 05:50

7-6 To Buy or Not to Buy - Hard Version （PAT ADSAA）

#include#include#include#includeconstintsz=62;intN,minNbr,extraNbr,missNbr,cnt;std::stringwant;std::vectorwantCnt(sz,0);std::vectorvec;std::vector>vecCnt;std::vectorflag;std::vectorbeads(sz);boolcmp(c
天天AZ·2023-06-21 05:19
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他