Codility经典算法题之十九：Brackets

Task description:

A string S consisting of N characters is considered to be properly nested if any of the following conditions is true:

• S is empty;
• S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string;
• S has the form "VW" where V and W are properly nested strings.

For example, the string "{[()()]}" is properly nested but "([)()]" is not.

Write a function:

class Solution { public int solution(String S); }

that, given a string S consisting of N characters, returns 1 if S is properly nested and 0 otherwise.

For example, given S = "{[()()]}", the function should return 1 and given S = "([)()]", the function should return 0, as explained above.

Assume that:

• N is an integer within the range [0..200,000];
• string S consists only of the following characters: "(", "{", "[", "]", "}" and/or ")".

Complexity:

• expected worst-case time complexity is O(N);
• expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

Solution：

我的理解是看看给定列表是否对称？

def soluton(S):
    if len(S) % 2 == 1:
        return 0
    nested = {"]":"[","}":"{",")":"("}
    half = ["[","{","("]
    stack = []
    for ele in S:
        if ele in half:
            stack.append(ele)
        else:
            if len(stack) == 0:
                return 0
            elif nested[ele] != stack.pop():
                return 0
    if len(stack) == 0:
        return 1
    else:
        return 0