主要算法：通过c来得到键盘输入的字符，进行判断是否合法，i的值来判断是否是相邻括号，t来记录相邻括号的个数，count来记录当前的嵌套数，k来记录最大的嵌套数，n来记录括号的对数。-The main algorithm: through C to receive keyboard input characters, to judge whether it is legitimate, the value of I to determine whether the adjacent brackets, t to record the number of adjacent brackets, count to record the current number of nested, K to record the maximum number of nested parentheses, n to record the log.