From 4e745cd1f1a5bba495f0b20dc7664f8a09516c17 Mon Sep 17 00:00:00 2001 From: linyongji Date: Sat, 16 Jan 2021 16:49:23 +0800 Subject: [PATCH] =?UTF-8?q?=E5=88=86=E6=94=AF5=E5=AE=8C=E6=88=90=E4=BA=86?= =?UTF-8?q?=E9=A2=98=E7=9B=AE=EF=BC=8C=E5=B9=B6=E5=81=9A=E4=BA=86=E5=8D=95?= =?UTF-8?q?=E5=85=83=E6=B5=8B=E8=AF=95?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Alogrithm/.vs/Alogrithm/v16/.suo | Bin 62464 -> 71168 bytes Alogrithm/Alogrithm/Alogrithm.vcxproj | 5 +- Alogrithm/Alogrithm/Alogrithm.vcxproj.filters | 9 ++ Alogrithm/Alogrithm/config/5_MinDepth.ini | 18 ++++ .../Alogrithm/config/6_ContainsDuplicate.ini | 0 Alogrithm/Alogrithm/include/5_MinDepth.h | 18 ++++ .../Alogrithm/include/6_ContainsDuplicate.h | 0 Alogrithm/Alogrithm/src/5_MinDepth.cpp | 83 ++++++++++++++++++ .../Alogrithm/src/6_ContainsDuplicate.cpp | 0 Alogrithm/UnitTest/UnitTest.cpp | 20 +++++ Alogrithm/UnitTest/UnitTest.vcxproj | 2 +- Alogrithm/UnitTest/pch.cpp | 22 ++++- Alogrithm/UnitTest/pch.h | 3 + 13 files changed, 177 insertions(+), 3 deletions(-) create mode 100644 Alogrithm/Alogrithm/config/5_MinDepth.ini create mode 100644 Alogrithm/Alogrithm/config/6_ContainsDuplicate.ini create mode 100644 Alogrithm/Alogrithm/include/5_MinDepth.h create mode 100644 Alogrithm/Alogrithm/include/6_ContainsDuplicate.h create mode 100644 Alogrithm/Alogrithm/src/5_MinDepth.cpp create mode 100644 Alogrithm/Alogrithm/src/6_ContainsDuplicate.cpp diff --git a/Alogrithm/.vs/Alogrithm/v16/.suo b/Alogrithm/.vs/Alogrithm/v16/.suo index 429e3885a9fa73c3178eff991c900708dee9ae37..e37636e2d54224c33e4152c61ca41ced8053237b 100644 GIT binary patch delta 6437 zcmds54^)&@7XRMIH!uS;$e$Vh_>VymNCy0dzal6z!w?oGU@Td=0g?fxFzJ|@CSV=c zTsGmm)l#P;oN$Yw8kOb9J#C#|el_BO@bNaej!|FO`1J*i<;m>y?lA&G__R zC)jjY#W%8OxWGTew!>P#B4sc#DiBceb)u#j8^NLY56c8#LS!S&=Z`%Vf>^0P4r{DN z0l5o1WBKc$VAYDSy<0R7!h%Z0z@5R0pbT7ACGl>TWRD? zQP`M+ppS0Cy2#VM#Z%A6I?vN49xCNm^l!udqPEiT(8?k&y{FA??F!BvPKY_!^9CO!O-aMzrfRSff0F9w$;G z$YKeILWFlww3y68o_IY5qs4sgcU)23%GmTJEaa4vNl;SA3e0CLZ`Gs76T~wd#pi+bttQryQ5yjBU8(}D-1gz!Qk9?SY3~SZNECWwVG?-!qWijrs)U!*) zL2UHP44E>6ORp5@e3J?kYShdjc`(cKb-F@}v;k<2%?FWJ!W*%l6n7{%K$ zVq8SRei)8^OC`r)3X^W`@nymd-j01jneRu^odV-wcxodXg0*o)vinegcYhdnM8(LV z=!_9XL2}}*5^xDRdvxI4oQWk$3axrC!G1%Fq|G0z5B`z>-)ZNMQHVbUaGd1Qqyhz_ zc;YJ@6JXWkTZMQcKuGGdA=`~q6NoOU~S9`5H~%BTu1Q_q#S{@)87Vb5js#( zH^eQDac_lUxGb`LahX6@lw1DAM^tk3po^0zLH=k2ieuCt>A3+ceNo_$MChI!JUfG{ z;BLVnQ;*SU31{Q%TrFNk)UV?{Tyg%*yuR;L`^D_&R{s$10>v~}mRVW0GTH}dBP z+KzH~KS2M!RQ3cgbEE0%Q`K_OPwUzrC@f4`^Owf ziR~m8Sq5CaCWpwgb});1PSY9}FPR3~Z2mA{ibL=AcVzNXe7;J)AL*i{y)h-MiZ2#; z>iRf53xEsp#mWdI(@p7CQbLnLftpaka7?jKGD_Cd5zT;$`XU9R8`5_k#d`eUxP0W& z-A8U_x?&B|PCJK_l|1CXn+31gGM)9g5|b9lJ_7ayC9>-!c~)=^El@K@3GYbZrGqXt z?bKV~(7|*j;dWOqyt?wL(IPf3W!<)eiNnotievkPPlq44_tp)OPD5YP#TRtjw*>Cq zO1FcoK$@0eD)XFA9|rnF_B@zpKgcrSz@m z83r5MEfBv=4~s2#X)d9cW~% znX{pCGmAc7`09IMgW3J`Us-k8&H@eTs#Op z_XN^{z$Ch$V~0sTl^gMshY+BiIMFGDyw4m~h91b!4;!R=V&TKpM$qLXS!z~Lpr>7v zuFT6CYF5<>uEfzzb{;h7cr4fXb_y84yYRkmey)m8Q- zP*F2MvbZ$#FI{lY=+yKNQJ+StOAcMMpaya{Wh$5&)<8^mraNJn5gGiJ`%a8GsQ( zLmGyNWPDuCL`oXA((yHH#(N1tx8)($v)17kLjv3N#P!%3#v3n3|l9H=|=A4<&~i;Kv#Y2_Ds?yxvW?UNWjb zc-%GUz8a=|BzT3u+JKmZuwKJX!D9|)k!PtuGN{I9x!N%!W4?jVm#2f>8BHn=#M_0# z0MA*;?>0yI%z&|Y{rYujmTWQAm?~{<{S~qT=@l2u=$Jf4pD4z>(M_T|`|9+{u>g0MGS;n@@yk-3e)wixKDt5K8>v#%%r%;4fU$^XOvQ3T1)bt1Pn?P34bBM1XM3+bJHmHfA-o3V*t?rntUdofO)3j}T78E8G83pTTe z7bg8I`V_Ri*Ff+4n5(}l-S2z+<!DV?VK3EV0WzpRQ1QB&%SH&lbL88RBpi*B{*0dPw;-i^V zNtOL+wNs6{cIs%75xKUV(bS-3GLEr9$J9&a9i`vjWl<25m}K%_ z4)d9F&hMOiUcbjVOXE9AS?qzJJ3bou{;7)U8{vcXjnQFHt5 zO_53)Wxw#z19`hRK@AZz^ltQ&0eSzO85JcYX-70_NEQ-GqQ5^%Jg5=59>fC^$OQdB z4B&Q7X(;o@qktX6fhbT3xP374SzrJd12RA);O}Q3PXg(H`^F;AlB6kG#es?e`~(aG zHjoWQgRvkF31>7qooXg`CsLuoQ!7Jgm1<03#%U!)XJD2yUuY6ig(AsOmf*&DY3m(zCx*Rc-KGm%btE+93 z@&fAe_f%K+%oZLH6;>Q8jpf}6;&M*~a=lxDI`n;>0=W+>a5(6xK#2XFtU>P3a{|^N zn_^glnud!|Hv?AS2=J@|3n60#@>ra@t%1v|K+eY@XR8?x5<#-mJjc>kt2t=m?z!Ro zd0H(9w{bsC->+5;W6U}MZvp**9+24>r;A1*j>Z{>`v;;l2qb~QUY1t}mE z3wb9AG_;M_vSq!9*|# zxB$0JLGA_~FgYxnihM30Yh><(N)%oO^T2#i1zrIQz(TMHECx%!Qm_mx2i4#)HAhaO zYNMI%L{{tBui54}E~!3KlduZzgGEGy^B)cs2k}h~)k>cmO{zKi3(;Js1Wca3XBNt+aQ7HL}LGZo95ra*EI;<6R zS;l%&DijViEDS7EgiN8qSthoRU63|$i+#vF{bdwbNNGb$6|GP=bWb1?+ms!`KpQh( zQbvYH>8Id4je`E0Ia^5x%XB-rKn)|`rnJH|WpY?dzQQttz_6VhUU&)Or}Ut3Hjk>? zjA1^Z>s4duPSp_lAhD>=shXZW)fB(jLJg@i^c=nUdhFV2YCE}yPY4va4T8fOM?GyW z6KyOgQzE$9Lk}X79u$=6tq^k{*M{(oYt$LB9s`Aj<0SclOzm##Nb~A>3w(`tbxv;z zjKW+TX*tTWQ1>?!PEo_Cj}*Qkdd^3_tQJZemZorY?;2oOMXwGW!`ihId58}0siEX_MX&~9mdENF`;;UiT;dHv(}`BGoss zNwiM)2!(IR-fNhltwCo+gF>O)ztWx3II_!TwWHJ|XxlGKXvAJCEvsH6jOv9elSFWb z2)2u0r5qTN_JZcuy22yKlLbdv*%X{7zraG&P;q}b;L@y?d@iq^FHt;?w9`>LTqY5$ zkOMw9x#Jz=^WpeBXymKDOD`LnTC1Am(&{r;E^fN%4V?~Um)vT3{PBr@o;mktl$(yY zVs6YTo?Q5^?2=IVt(2Ba%A(_tJFZtWto$%H~M*0}S+$9I1RIgHyDSU6Lu z@%d`WyRgnIr>`_0bGb@)rk9EG-M7!H*B06p?{cXQe@UCK?~ZfS->y6Rk3ZhK95Z3} z{-WC76g01H{ll==R{Q?cf<->L_fJ625Ahm3iwKm6{4Q*B0CI}~_ohro$Hr3D{TS8v z>ULpxtMY^N;8l12ih#{+&_HgxJrok6aTymOx2@rujQn2~_M)p}7Y#;w;ZtS?#)7FWoQ6Ci^KP-EsG) zGQUNzBvx%Z;u66ta+h%=&UwF~-;JUEI>&<46I08lKKl8i_Oj8NPEy;nc(Uz`qvEac zbfeKN*29(^WIr5DRkJg7jsjb5E;YWnMQn$Be0YY!;4(SVk#8HfdCJl?^))s0?!pCg>uWaDFIZEnx}0s|+wLQzxJ@o0W_~aMZto(IKMF7%s0OE+)Rj3x8|1hGpZm}Hodn^OStFec~nDumRqJ_S= zZ%$yTrC3@ct(R6x8>CvvC#{m!QdE8A{%savp(Xe6{zP>mwbi?5UCq-l7Rg~u5xFGV zJ1JOaSM7l$ncDW|MrBKcyNKWM{iF-DGZT3m z>*&pWdb<4C>oone$;j6YUxgn2Zc}iT@+}PeSlf{Z66dnmWohE!OgeQj!^l5{5NIUN zSFPC6=dLMx5(BWunBIFFy{cF1vnNn=xZH^Frv3KuoTSBvwvhL@Li^vkn_z;tJMpW4 zA3&Zy=iMhJEw8Ja6<$v?lwuLRYP9dTTRTHG7fzlh`ifzFjmGDjH^1hwPj(dN1=q=e zvu)%!lx);@H@dsWHuRB%6@EPKSmOghvkxcH`^N|IWJ&yf}_{o-N1c@}=7XG;#rDmn4b1gE54yR`dzbO2$f!T&1wIUrHY>U?rt za;c3E8%6MHM3-v>FU!5WBO+VcPGaAC&sgtMC1xBN`BnZA-F<*v=N-HzldC25>zw5h z?K?c5nm3fvyPKlb%1=&4s3N*kh)zmASovIUnT{Rtp=;jqhMc=NcuO|*d@PaofUS=i zed*OUT=SfmbAx~IoM$85P+|^=~^SsIHPW I5xl4WKN-$+8vpApplication true v142 - Unicode + MultiByte Application @@ -144,6 +144,7 @@ + @@ -151,12 +152,14 @@ + + diff --git a/Alogrithm/Alogrithm/Alogrithm.vcxproj.filters b/Alogrithm/Alogrithm/Alogrithm.vcxproj.filters index 1b932e1..3d3b3bc 100644 --- a/Alogrithm/Alogrithm/Alogrithm.vcxproj.filters +++ b/Alogrithm/Alogrithm/Alogrithm.vcxproj.filters @@ -39,6 +39,9 @@ 源文件\src + + 源文件\src + @@ -53,6 +56,9 @@ 头文件\include + + 头文件\include + @@ -67,5 +73,8 @@ 资源文件\config + + 资源文件\config + \ No newline at end of file diff --git a/Alogrithm/Alogrithm/config/5_MinDepth.ini b/Alogrithm/Alogrithm/config/5_MinDepth.ini new file mode 100644 index 0000000..5fa6d8b --- /dev/null +++ b/Alogrithm/Alogrithm/config/5_MinDepth.ini @@ -0,0 +1,18 @@ +[Test1] +input=3,9,20,NULL,NULL,15,7 +output=2 +[Test2] +input=4,3,1,2,NULL,6,8 +output=3 +[Test3] +input=4,3,1,NULL,2,6,8 +output=3 +[Test5] +input=NULL +output=1 +[Test6] +input= +output=0 +[Test7] +input=1,0,0,2,NULL,NULL,0 +output=3 \ No newline at end of file diff --git a/Alogrithm/Alogrithm/config/6_ContainsDuplicate.ini b/Alogrithm/Alogrithm/config/6_ContainsDuplicate.ini new file mode 100644 index 0000000..e69de29 diff --git a/Alogrithm/Alogrithm/include/5_MinDepth.h b/Alogrithm/Alogrithm/include/5_MinDepth.h new file mode 100644 index 0000000..8ad75fd --- /dev/null +++ b/Alogrithm/Alogrithm/include/5_MinDepth.h @@ -0,0 +1,18 @@ +#pragma once +#include +#include +#include + + +struct TreeNode +{ + int val; + struct TreeNode* left; + struct TreeNode* right; +}; + + +int MinDepth(struct TreeNode* root); +TreeNode* CreatBitTree(char str[][50], int return_count); +void CreatBitTreeNode1(char str[][50], int return_count, TreeNode* cur, int curIndex); +void free_tree(TreeNode* T); diff --git a/Alogrithm/Alogrithm/include/6_ContainsDuplicate.h b/Alogrithm/Alogrithm/include/6_ContainsDuplicate.h new file mode 100644 index 0000000..e69de29 diff --git a/Alogrithm/Alogrithm/src/5_MinDepth.cpp b/Alogrithm/Alogrithm/src/5_MinDepth.cpp new file mode 100644 index 0000000..704e717 --- /dev/null +++ b/Alogrithm/Alogrithm/src/5_MinDepth.cpp @@ -0,0 +1,83 @@ +#include "../include/5_MinDepth.h" + +TreeNode* CreatBitTree(char str[][50], int return_count) +{ + if (str == NULL || return_count <= 0) { + return NULL; + } + TreeNode* head = (TreeNode*)malloc(sizeof(TreeNode)); + if (NULL == head) { + return NULL; + } + head->val = _ttoi(str[0]); + CreatBitTreeNode1(str, return_count, head, 0); + return head; +} +void CreatBitTreeNode1(char str[][50], int return_count, TreeNode* cur, int curIndex) +{ + if (str == NULL || return_count <= 0 || cur == NULL || curIndex >= return_count || curIndex < 0) { + return; + } + int last = return_count - 1; + if ((2 * curIndex + 1 <= last) && strcmp(str[2 * curIndex + 1], "NULL")) { + cur->left = (TreeNode*)malloc(sizeof(TreeNode)); + if (NULL == cur->left) { + return; + } + cur->left->val = _ttoi(str[2 * curIndex + 1]); + } + else { + cur->left = NULL; + } + if ((2 * curIndex + 2 <= last) && strcmp(str[2 * curIndex + 2], "NULL")) { + cur->right = (TreeNode*)malloc(sizeof(TreeNode)); + if (NULL == cur->right) { + return; + } + cur->right->val = _ttoi(str[2 * curIndex + 2]); + } + else { + cur->right = NULL; + } + CreatBitTreeNode1(str, return_count, cur->left, 2 * curIndex + 1); + CreatBitTreeNode1(str, return_count, cur->right, 2 * curIndex + 2); +} +int MinDepth(struct TreeNode* root) +{ + int Depth = 0; + int L1, L2; + if (NULL == root) { + return 0; + } + else if ((NULL == root->left) && (NULL == root->right)) { + return 1; + } + else if ((NULL != root->left) && (NULL == root->right)) { + Depth = MinDepth(root->left); + } + else if ((NULL == root->left) && (NULL != root->right)) { + Depth = MinDepth(root->right); + } + else { + L1 = MinDepth(root->left); + L2 = MinDepth(root->right); + Depth = fmin(L1, L2); + } + return Depth + 1; +} +void free_tree(TreeNode* T)//ͷ +{ + if (!T) { + return; + } + if (T->left) { + free_tree(T->left); + } + if (T->right) { + free_tree(T->right); + } + if (T) { + free(T); + T = NULL; + } +} \ No newline at end of file diff --git a/Alogrithm/Alogrithm/src/6_ContainsDuplicate.cpp b/Alogrithm/Alogrithm/src/6_ContainsDuplicate.cpp new file mode 100644 index 0000000..e69de29 diff --git a/Alogrithm/UnitTest/UnitTest.cpp b/Alogrithm/UnitTest/UnitTest.cpp index 08d0654..7fc0a00 100644 --- a/Alogrithm/UnitTest/UnitTest.cpp +++ b/Alogrithm/UnitTest/UnitTest.cpp @@ -6,6 +6,7 @@ using namespace Microsoft::VisualStudio::CppUnitTestFramework; #define FileName_2 "../Alogrithm/config/2_ExcelSheetColumnTiTle.ini" #define FileName_3 "../Alogrithm/config/3_bool IsUgly.ini" #define FileName_4 "../Alogrithm/config/4_IsPalindrome.ini" +#define FileName_5 "../Alogrithm/config/5_MinDepth.ini" namespace UnitTest { @@ -73,4 +74,23 @@ namespace UnitTest } } }; + TEST_CLASS(UnitTest_5) + { + TEST_METHOD(TestMethode1) + { + char Section_Name[100][10] = { 0 }; + int Section_Count = CalcCount(100, Section_Name, FileName_5); + CString Na, nExpect; + for (int i = 0; i < Section_Count; i++) { + GetPrivateProfileString(Section_Name[i], "input", " ", Na.GetBuffer(200), 200, FileName_5); + GetPrivateProfileString(Section_Name[i], "output", " ", nExpect.GetBuffer(20), 20, FileName_5); + char return_str[100][50] = { 0 }; + int return_count = str_device2(Na, return_str); + TreeNode* root = CreatBitTree(return_str, return_count); + int nReal = MinDepth(root); + Assert::AreEqual(nReal,_ttoi(nExpect)); + free_tree(root); + } + } + }; } diff --git a/Alogrithm/UnitTest/UnitTest.vcxproj b/Alogrithm/UnitTest/UnitTest.vcxproj index 0f62b5f..aa3f479 100644 --- a/Alogrithm/UnitTest/UnitTest.vcxproj +++ b/Alogrithm/UnitTest/UnitTest.vcxproj @@ -103,7 +103,7 @@ Windows $(VCInstallDir)UnitTest\lib;%(AdditionalLibraryDirectories) DebugFull - ../Alogrithm/Debug/1_ContainsNearbyDuplicate.obj;../Alogrithm/Debug/2_ExcelSheetColumnTitle.obj;../Alogrithm/Debug/3_bool IsUgly.obj;../Alogrithm/Debug/4_IsPalindrome.obj;%(AdditionalDependencies) + ../Alogrithm/Debug/1_ContainsNearbyDuplicate.obj;../Alogrithm/Debug/2_ExcelSheetColumnTitle.obj;../Alogrithm/Debug/3_bool IsUgly.obj;../Alogrithm/Debug/4_IsPalindrome.obj;../Alogrithm/Debug/5_MinDepth.obj;%(AdditionalDependencies) diff --git a/Alogrithm/UnitTest/pch.cpp b/Alogrithm/UnitTest/pch.cpp index 3936926..39c05ed 100644 --- a/Alogrithm/UnitTest/pch.cpp +++ b/Alogrithm/UnitTest/pch.cpp @@ -70,7 +70,25 @@ int* str_device(CString str, int* value_count) return Section_devide; //返回数组首地址 } #endif - +//字符串切割函数，返回值为切割后元素的个数，每个元素的类型为字符串型 +int str_device2(CString str, char(*return_str)[50]) +{ + int value_count = 0; + char* token; //存放被切割后的第一个子串 + char Section_value[500] = { 0 };//存放nums转换成string类型的结果 + memset(Section_value, 0, sizeof(char) * 500); + strcpy(Section_value, str);//将CString类型的字符串转换成char类型，方便后面切割字符串 + //获得切割到的第一个字符串 + token = strtok(Section_value, ","); + /* 继续获取其他的子字符串 */ + while (token != NULL) { + strcpy(return_str[value_count], token); + token = strtok(NULL, ","); + value_count++; //记录存了多少个元素 + } + return value_count; //返回数组首地址 +} +//字符串转bool bool CstrToBool(CString str) { if (str == "1") { @@ -78,3 +96,5 @@ bool CstrToBool(CString str) } return 0; } + + diff --git a/Alogrithm/UnitTest/pch.h b/Alogrithm/UnitTest/pch.h index eb25a56..01f0539 100644 --- a/Alogrithm/UnitTest/pch.h +++ b/Alogrithm/UnitTest/pch.h @@ -17,11 +17,14 @@ #include"../Alogrithm/include/2_ExcelSheetColumnTitle.h" #include"../Alogrithm/include/3_bool IsUgly.h" #include"../Alogrithm/include/4_IsPalindrome.h" +#include"../Alogrithm/include/5_MinDepth.h" int CalcCount(int n, char(*str)[10],const char *FileName); int* str_device(CString str, int* value_count); +int str_device2(CString str, char(*return_str)[50]); bool CstrToBool(CString str); + #endif //PCH_H