括号匹配--今日头条2017年实习生招聘笔试题

这里写图片描述
这里写图片描述
这里写图片描述
这里写图片描述

Java版本:

package Interview;

import java.util.Scanner;
import java.util.Stack;

/**
 * @date: 30/03/2017 7:42 PM
 * @author: qinjiangbo@github.io
 */
public class VerticalBrackets {

    private static int valid(char[] brackets) {
        Stack<Character> stack = new Stack<>();
        int maxLen = 0, count = 0;
        for (char ch: brackets) {
            if (ch == '[') { stack.push(ch); }
            if (ch == ']') {
                stack.pop();
                count++;
                if (stack.empty()) {
                    maxLen = maxLen > count * 2 + 1 ? maxLen : count * 2 + 1;
                    count = 0;
                }
            }
        }
        return maxLen;
    }

    public static String generate(int maxLen, char[] brackets) {
        StringBuilder stringBuilder = new StringBuilder();
        Stack<String> strings = new Stack<>();
        int len = brackets.length;
        int count = 0;
        for (int i = 0; i < len - 1; i++) {
            if (brackets[i] == ']') {
                stringBuilder.append(strings.pop());
                count--;
            } else {
                int hyphen = maxLen - 2 - count * 2;
                int blank = count == 0 ? 0 : count - 1;
                String s = genLine(hyphen, blank, count, true, false);
                strings.push(s);
                stringBuilder.append(s);
                count++;
                if (brackets[i] == '[' && brackets[i+1] == ']') {
                    int blank2 = count == 0 ? 0 : count - 1;
                    stringBuilder.append(genLine(hyphen, blank2, count, false, true));
                    stringBuilder.append('\n');
                    stringBuilder.append(genLine(hyphen, blank2, count, false, true));
                }
            }

        }
        String s = strings.pop();
        stringBuilder.append(s.substring(0, s.length()-1));
        return stringBuilder.toString();
    }

    private static String genLine(int hyphen, int blank, int count, boolean plusExist, boolean blankExist) {
        StringBuilder stringBuilder = new StringBuilder();
        for (int k = 0; k < blank; k++) {
            stringBuilder.append(' ');
        }
        if (count > 0) { stringBuilder.append('|'); }
        if (plusExist) { stringBuilder.append('+'); }
        for (int k = 0; k < hyphen; k++) {
            if (blankExist) {
                stringBuilder.append(' ');
            } else {
                stringBuilder.append('-');
            }
        }
        if (plusExist) { stringBuilder.append('+'); }
        if (count > 0) { stringBuilder.append('|'); }
        for (int k = 0; k < blank; k++) {
            stringBuilder.append(' ');
        }
        stringBuilder.append('\n');
        return stringBuilder.toString();
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String bracket = scanner.nextLine();
        char[] brackets = bracket.toCharArray();
        int maxLen = valid(brackets);
        String result = generate(maxLen, brackets);
        System.out.println(result);
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值