1111. Maximum Nesting Depth of Two Valid Parentheses Strings

class Solution {
    public int[] maxDepthAfterSplit(String seq) {
        int n = seq.length();
        int[] ans = new int[n];
        int depth = 0;

        for (int i = 0; i < n; i++) {
            if (seq.charAt(i) == '(') {
                depth++;
                ans[i] = depth % 2;
            } else {
                ans[i] = depth % 2;
                depth--;
            }
        }

        return ans;
    }
}

class Solution:
    def maxDepthAfterSplit(self, seq):
        n = len(seq)
        ans = [0] * n
        depth = 0

        for i in range(n):
            if seq[i] == '(':
                depth += 1
                ans[i] = depth % 2
            else:
                ans[i] = depth % 2
                depth -= 1

        return ans

class Solution {
public:
    vector<int> maxDepthAfterSplit(string seq) {
        int n = seq.size();
        vector<int> ans(n);
        int depth = 0;

        for (int i = 0; i < n; i++) {
            if (seq[i] == '(') {
                depth++;
                ans[i] = depth % 2;
            } else {
                ans[i] = depth % 2;
                depth--;
            }
        }

        return ans;
    }
};

class Solution {
    maxDepthAfterSplit(seq) {
        const n = seq.length;
        const ans = new Array(n);
        let depth = 0;

        for (let i = 0; i < n; i++) {
            if (seq[i] === '(') {
                depth++;
                ans[i] = depth % 2;
            } else {
                ans[i] = depth % 2;
                depth--;
            }
        }

        return ans;
    }
}