牧之

描述Given a string containing just the characters ’(’, ’)’, ’{’, ’}’, ’[’ and ’]’ , determine if theinput string is valid.The brackets must close in the correct order, ”()” and ”()[]” are all vali

题目：Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",

描述Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples:["2", "1", "+", "

struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};//先序遍历递归版本vector result;vector preorderTraversal(TreeNode *root) { i

//中序遍历递归版本vector result;vector inorderTraversal(TreeNode *root) { if (root!=NULL) { inorderTraversal(root->left); result.push_back(root->val); inorderTraversal(root->right); } return re