分支12完成，提交

.gitignore

@@ -131,3 +131,6 @@ Alogrithm/.vs/Alogrithm/v16/ipch/AutoPCH/8c1a78e28f38071c/11_CANWINNIM.ipch
 Alogrithm/.vs/Alogrithm/v16/ipch/AutoPCH/80ee02d8a95bc92a/11_CANWINNIM.ipch
 .vs/tasks.vs.json
 Alogrithm/.vs/Alogrithm/v16/ipch/AutoPCH/95ff4e0647685c25/11_CANWINNIM.ipch
+Alogrithm/.vs/Alogrithm/v16/ipch/AutoPCH/ec9d75c6b219f9bb/12_ISVALID.ipch
+Alogrithm/Alogrithm/Debug/12_IsValid.obj
+Alogrithm/UnitTest/Debug/UnitTest.tlog/link.16692.delete.1.tlog

Alogrithm/Alogrithm/Alogrithm.vcxproj

@@ -142,6 +142,7 @@
   <ItemGroup>
     <ClCompile Include="src\10_BinaryTreePaths.cpp" />
     <ClCompile Include="src\11_CanWinNim.cpp" />
+    <ClCompile Include="src\12_IsValid.cpp" />
     <ClCompile Include="src\1_ContainsNearbyDuplicate.cpp" />
     <ClCompile Include="src\2_ExcelSheetColumnTitle.cpp" />
     <ClCompile Include="src\3_bool IsUgly.cpp" />
@@ -156,6 +157,7 @@
   <ItemGroup>
     <ClInclude Include="include\10_BinaryTreePaths.h" />
     <ClInclude Include="include\11_CanWinNim.h" />
+    <ClInclude Include="include\12_IsValid.h" />
     <ClInclude Include="include\1_ContainsNearbyDuplicate.h" />
     <ClInclude Include="include\2_ExcelSheetColumnTitle.h" />
     <ClInclude Include="include\3_bool IsUgly.h" />
@@ -169,6 +171,7 @@
   <ItemGroup>
     <None Include="config\10_BinaryTreePaths.ini" />
     <None Include="config\11_CanWinNim.ini" />
+    <None Include="config\12_IsValid.ini" />
     <None Include="config\1_ContainsNearbyDuplicate.ini" />
     <None Include="config\2_ExcelSheetColumnTiTle.ini" />
     <None Include="config\3_bool IsUgly.ini" />

Alogrithm/Alogrithm/Alogrithm.vcxproj.filters

@@ -60,6 +60,9 @@
     <ClCompile Include="src\11_CanWinNim.cpp">
       <Filter>源文件\src</Filter>
     </ClCompile>
+    <ClCompile Include="src\12_IsValid.cpp">
+      <Filter>源文件\src</Filter>
+    </ClCompile>
   </ItemGroup>
   <ItemGroup>
     <ClInclude Include="include\2_ExcelSheetColumnTitle.h">
@@ -95,6 +98,9 @@
     <ClInclude Include="include\10_BinaryTreePaths.h">
       <Filter>头文件\include</Filter>
     </ClInclude>
+    <ClInclude Include="include\12_IsValid.h">
+      <Filter>头文件\include</Filter>
+    </ClInclude>
   </ItemGroup>
   <ItemGroup>
     <None Include="config\3_bool IsUgly.ini">
@@ -130,5 +136,8 @@
     <None Include="config\11_CanWinNim.ini">
       <Filter>资源文件\config</Filter>
     </None>
+    <None Include="config\12_IsValid.ini">
+      <Filter>资源文件\config</Filter>
+    </None>
   </ItemGroup>
 </Project>

Alogrithm/Alogrithm/config/12_IsValid.ini

@@ -0,0 +1,21 @@
+[Test1]
+input=()
+output=1
+[Test2]
+input={}
+output=1
+[Test3]
+input={]
+output=0
+[Test4]
+input=}}(){]
+output=0
+[Test5]
+input=([]}
+output=0
+[Test6]
+input=(])}}}{}{}{}
+output=0
+[Test7]
+input={{{([()])}}}{}
+output=1

Alogrithm/Alogrithm/include/12_IsValid.h

@@ -0,0 +1,6 @@
+#pragma once
+
+#include<stdlib.h>
+#include<string.h>
+
+bool IsValid(char* s);

Alogrithm/Alogrithm/src/12_IsValid.cpp

@@ -0,0 +1,29 @@
+#include "../include/12_IsValid.h"
+#pragma warning(disable:6385)
+#pragma warning(disable:6386)
+//思路：让左括号进栈，右括号和左括号依次进行匹配。
+bool IsValid(char* s) {
+	int s_len = strlen(s);//定义一个int变量，存放字符串长度
+	char* stack = (char*)malloc(sizeof(char) * (s_len + 2));//定义一个char*指针用来模拟一个栈
+	int top = 0;//定义一个变量，用来访问stack
+	if (s_len % 2 != 0) {//如果字符串长度为奇数的话，肯定不匹配，直接返回false
+		return false;
+	}
+	for (int i = 0; i < s_len; i++) {//循环遍历字符串，将字符入栈
+		if ((s[i] == '(') || (s[i] == '{') || (s[i] == '[')) {//如果是左括号，则入栈
+			top++;//top后移
+			stack[top] = s[i];//入栈
+		}//如果是右括号，则和前一个符号做比较，相同说明匹配，top前移；
+		else if ((s[i] == ')' && stack[top] == '(') || (s[i] == '}' && stack[top] == '{') || (s[i] == ']' && stack[top] == '[')) {
+			top--;
+		}
+		else {//前面的符号不匹配，或者找不到，返回false
+			return false;
+		}
+	}//遍历完以后判断top是不是移到最开始的位置，
+	if (top == 0) {//是则返回true
+		return true;
+	}
+	return false;//否，则返回false
+	free(stack);
+}

Alogrithm/Alogrithm/src/main.cpp

@@ -1,7 +1,7 @@
 #include<stdio.h>
-#include "../include/11_CanWinNim.h"
+
 int main()
 {
-	printf("%d\n",CanWinNim(6));
+
 	return 0;
 }

Alogrithm/UnitTest/UnitTest.cpp

@@ -13,6 +13,7 @@ using namespace Microsoft::VisualStudio::CppUnitTestFramework;
 #define FileName_9  "../Alogrithm/config/9_AddBinary.ini"
 #define FileName_10 "../Alogrithm/config/10_BinaryTreePaths.ini"
 #define FileName_11 "../Alogrithm/config/11_CanWinNim.ini"
+#define FileName_12 "../Alogrithm/config/12_IsValid.ini"
 
 
 namespace UnitTest
@@ -218,4 +219,21 @@ namespace UnitTest
 			}
 		}
 	};
+	TEST_CLASS(UnitTest_12)
+	{
+		TEST_METHOD(TestMethode1)
+		{
+			char Section_Name[100][10] = { 0 };
+			int  Section_Count = CalcCount(100, Section_Name, FileName_12);
+			char input_char[1024] = { 0 };
+			CString input,output;
+			for (int i = 0; i < Section_Count; i++) {
+				GetPrivateProfileString(Section_Name[i], "input", " ", input.GetBuffer(200), 200, FileName_12);
+				GetPrivateProfileString(Section_Name[i], "output", " ", output.GetBuffer(20), 20, FileName_12);
+				strcpy(input_char, input);
+				bool nReal = IsValid(input_char);
+				Assert::AreEqual(nReal, CstrToBool(output));
+			}
+		}
+	};
 }

Alogrithm/UnitTest/UnitTest.vcxproj

@@ -103,7 +103,7 @@
       <SubSystem>Windows</SubSystem>
       <AdditionalLibraryDirectories>$(VCInstallDir)UnitTest\lib;%(AdditionalLibraryDirectories)</AdditionalLibraryDirectories>
       <GenerateDebugInformation>DebugFull</GenerateDebugInformation>
-      <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;../Alogrithm/Debug/6_ContainsDuplicate.obj;../Alogrithm/Debug/7_MaxDepth.obj;../Alogrithm/Debug/8_HammingWeight.obj;../Alogrithm/Debug/9_AddBinary.obj;../Alogrithm/Debug/10_BinaryTreePaths.obj;../Alogrithm/Debug/11_CanWinNim.obj;%(AdditionalDependencies)</AdditionalDependencies>
+      <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;../Alogrithm/Debug/6_ContainsDuplicate.obj;../Alogrithm/Debug/7_MaxDepth.obj;../Alogrithm/Debug/8_HammingWeight.obj;../Alogrithm/Debug/9_AddBinary.obj;../Alogrithm/Debug/10_BinaryTreePaths.obj;../Alogrithm/Debug/11_CanWinNim.obj;../Alogrithm/Debug/12_IsValid.obj;%(AdditionalDependencies)</AdditionalDependencies>
     </Link>
   </ItemDefinitionGroup>
   <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">

Alogrithm/UnitTest/pch.h

@@ -24,6 +24,7 @@
 #include"../Alogrithm/include/9_AddBinary.h"
 #include"../Alogrithm/include/10_BinaryTreePaths.h"
 #include"../Alogrithm/include/11_CanWinNim.h"
+#include"../Alogrithm/include/12_IsValid.h"
 
 
 int CalcCount(int n, char(*str)[10],const char *FileName);