C 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2021-04-24

#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>

int main(){
    

    char str[51] = {0};
    scanf("%s",str);
    int n = 0;
    int count = 0;
    for(int i=0;'\0'!=str[i];++i){
        if('[' == str[i]){
	    // Push(s,'[');
	    ++n;
	} else if(']' == str[i]){
	    if(/*GetSize(s)*/ n == 0){
	        ++count;
	    }else{
	        // Pop(s);
		--n;
	    }
	}
    }
    for(int i=0;i<count;++i){
        printf("[");
    }

    printf("%s",str);

    // int n = GetSize(s);
    for(int i=0;i<n;++i){
        printf("]");
    }
    printf("\n");

}

C 解法, 执行用时: 2ms, 内存消耗: 324KB, 提交时间: 2019-02-17

#include<stdio.h>
int main()
{
    char s[51];
    scanf("%s",s);
    int i=0,left=0,right=0;
    while(s[i] != '\0')
    {
        if(s[i] == '[')
            left++;
        else if(left > 0)
            left--;
        else right++;
        i++;
    }
    
    for(right; right>0; right--)
        printf("[");
    printf("%s",s);
    for(left; left>0; left--)
        printf("]");
    
    return 0;
}

C 解法, 执行用时: 2ms, 内存消耗: 348KB, 提交时间: 2022-07-21

#include <stdio.h>

int main()
{
    char input[50];
    int i = 0;
    int stack_index = 0;
    int left_count = 0;
    int right_count = 0;
    scanf("%s", input);
    //printf("input:%s\n",input);
    
    for(i = 0; (i < 50)&&((input[i] == '[') || (input[i] == ']')); i++) {
        if (input[i] == '[') {
            stack_index++;
        } else {
            if (stack_index >= 1) {
                stack_index--;
            }else {
                left_count++;   //右括号未匹配，则左边加上一个左括号
                stack_index=0;
            }
        }
    }
    right_count = stack_index;
    
    for(i = 0; i < left_count; i++) {
        printf("[");
    }
    for(i = 0; (i < 50)&&((input[i] == '[') || (input[i] == ']')); i++) {
        printf("%c", input[i]);
        //printf("c");
    }
    for(i = 0; i < right_count; i++) {
        printf("]");
    }
    return 0;
}

C 解法, 执行用时: 2ms, 内存消耗: 368KB, 提交时间: 2019-05-26

#include<stdio.h>
int main()
{
    char s[51];
    scanf("%s",s);
    int i=0,left=0,right=0;
    while(s[i] != '\0')
    {
        if(s[i] == '[')
            left++;
        else if(left > 0)
            left--;
        else right++;
        i++;
    }
     
    for(right; right>0; right--)
        printf("[");
    printf("%s",s);
    for(left; left>0; left--)
        printf("]");
     
    return 0;
}

C 解法, 执行用时: 2ms, 内存消耗: 372KB, 提交时间: 2020-12-23

#include <stdio.h>
#include <string.h>

int main(){
    char* str = (char*)malloc(51*sizeof(char));
    while(scanf("%s", str) != EOF){
        char* stake = (char*)malloc(51*sizeof(char));
        int index = 0;
        int len = strlen(str);
        if(len == 0)break;
        for(int i = 0; i < len; i++){
            stake[index] = str[i];
            if(index == 0){
                index++;
                continue;
            }
            if((stake[index - 1] == '[')&&(stake[index] == ']')){
                index = index - 1;
            }else{
                index = index + 1;
            }
        }
        int flag = 0;
        if(index == 0){
            printf("%s\n", str);
            flag = 1;
        }
        for(int i = 0; i < index; i++){
            if(stake[i] == ']'){
                printf("%c", '[');
                continue;
            }
            if(stake[i] == '['){
                if(flag == 0){
                    printf("%s", str);
                    flag = 1;
                }
                printf("%c", ']');
            }
        }
        if(flag == 0){
            printf("%s\n", str);
        }else{
            printf("\n");
        }
    }
    return 0;
}