int minInsertionsOptimized(char* s) { int n = strlen(s); int* stack = (int*)malloc(n * sizeof(int)); int top = -1; int insertions = 0; for (int i = 0; i < n; i++) { char c = s[i]; if (c == '(' || c == '[') { // 左括号直接入栈 stack[++top] = c; } else { // 处理右括号 if (top == -1) { // 栈为空,需要插入对应的左括号 inserti...