| 38 | } |
| 39 | |
| 40 | fn par_checker3(par: &str) -> bool { |
| 41 | let mut char_list = Vec::new(); |
| 42 | for c in par.chars() { |
| 43 | char_list.push(c); |
| 44 | } |
| 45 | |
| 46 | let mut index = 0; |
| 47 | let mut balance = true; |
| 48 | let mut stack = Stack::new(); |
| 49 | while index < char_list.len() && balance { |
| 50 | let c = char_list[index]; |
| 51 | |
| 52 | // 开符号入栈 |
| 53 | if '(' == c || '[' == c || '{' == c { |
| 54 | stack.push(c); |
| 55 | } |
| 56 | |
| 57 | // 闭符号则判断是否平衡 |
| 58 | if ')' == c || ']' == c || '}' == c { |
| 59 | if stack.is_empty() { |
| 60 | balance = false; |
| 61 | } else { |
| 62 | let top = stack.pop().unwrap(); |
| 63 | if !par_match(top, c) { |
| 64 | balance = false; |
| 65 | } |
| 66 | } |
| 67 | } |
| 68 | |
| 69 | // 非括号直接跳过 |
| 70 | index += 1; |
| 71 | } |
| 72 | |
| 73 | balance && stack.is_empty() |
| 74 | } |
| 75 | |
| 76 | fn main() { |
| 77 | let sa = "(2+3){func}[abc]"; |