题目链接https://leetcode.com/problems/valid-parentheses/description/ 思路:建一个栈,当s[i]与stack[-1]是一对儿时,弹出。最后栈为空,就是true