1614. Maximum Nesting Depth of the Parentheses

[twy30]

https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/

using System;

public class Solution
{
    public int MaxDepth(string s)
    {
        // 「輸入的字串」
        var inputString = s;

        // 「輸出值」
        var output = 0;

        // 「深度」
        var depth = 0;

        for (int i = 0; i < inputString.Length; ++i)
        {
            switch (inputString[i])
            {
                case '(':
                    ++depth;
                    output = Math.Max(output, depth);
                    break;
                case ')':
                    --depth;
                    break;
            }
        }

        return output;
    }
}

---

請參考「刷 LeetCode 練習命名」 #69 😊