华为OD机试D卷-最大括号深度100分)JAVA

import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;

/**
 * 最大括号深度(100分)
 * 输入:([]{()}) 输出:3
 * 输入:[] 输出: 1
 * 输入:(] 输出:0
 * 输入:([)] 输出:0
 * 输入:)( 输出:0
 */
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.nextLine();
        System.out.println(findSymbolDepth(s));
    }

    private static int findSymbolDepth(String s) {
        Deque<Character> openStack = new ArrayDeque<>();
        Deque<Character> closeStack = new ArrayDeque<>();
        int depth = 0;
        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[' || c == '{') {
                openStack.push(c);
            } else {
                if (!openStack.isEmpty()) {
                    if (openStack.peek() == '(' && c == ')' || openStack.peek() == '[' && c == ']' || openStack.peek() == '{' && c == '}') {
                        openStack.pop();
                        continue;
                    }
                }
                closeStack.push(c);
            }
            depth = Math.max(depth, openStack.size());
        }
        return openStack.isEmpty() && closeStack.isEmpty() ? depth : 0;
    }
}

全部评论
应该这样写
点赞 回复 分享
发布于 04-11 15:29 安徽
private static int findSymbolDepth(String s) { Stack<character> openStack = new Stack<character>(); int depth = 0; for (char c : s.toCharArray()) { if (c == '(' || c == '[' || c == '{') { openStack.push(c); } else { if (!openStack.isEmpty()) { if (openStack.peek() == '(' && c == ')' || openStack.peek() == '[' && c == ']' || openStack.peek() == '{' && c == '}') { openStack.pop(); continue; } else { return 0; } } else { return 0; } } depth = Math.max(depth, openStack.size()); } return openStack.isEmpty() ? depth : 0; }</character></character>
点赞 回复 分享
发布于 04-11 15:29 安徽

相关推荐

爱吃肉的伊登在写日记:好棒,27届简历能做成这个样子,但是第一个项目感觉cover住难度还是不小的,特别是二面的时候肯定要对分布式系统设计这一块儿有高出正常面试者的水平才行
点赞 评论 收藏
分享
评论
2
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务