【LeetCode 385】Mini Parser(Python)

Problem:

Given a nested list of integers represented as a string, implement a parser to deserialize it.

Each element is either an integer, or a list -- whose elements may also be integers or other lists.

Note: You may assume that the string is well-formed:

  • String is non-empty.
  • String does not contain white spaces.
  • String contains only digits 0-9[- ,].

 

Example 1:

Given s = "324",

You should return a NestedInteger object which contains a single integer 324.

 

Example 2:

Given s = "[123,[456,[789]]]",

Return a NestedInteger object containing a nested list with 2 elements:

1. An integer containing value 123.
2. A nested list containing two elements:
    i.  An integer containing value 456.
    ii. A nested list with one element:
         a. An integer containing value 789.

Solution:

class Solution:
    def deserialize(self, s):
        """
        :type s: str
        :rtype: NestedInteger
        """
        stack = []
        num = 0
        num_flag = 0
        neg_flag = 0
        for c in s:
            if c == '[':
                stack.append([])
            elif c <= '9' and c >= '0':
                if num == 0:
                    num = int(c)
                else:
                    num = num*10+int(c)
                num_flag = 1
            elif c == ']':
                if num_flag == 1:
                    tmp = stack.pop()
                    tmp.append(num if neg_flag == 0 else -num)
                    stack.append(tmp)
                    num = 0
                    num_flag = 0
                    neg_flag = 0
                if len(stack) != 1:
                    tmp = stack.pop()
                    cur = stack.pop()
                    cur.append(tmp)
                    stack.append(cur)
            elif c == ',':
                if num_flag == 1 and stack != []:
                    cur = stack.pop()
                    cur.append(num if neg_flag == 0 else -num)
                    stack.append(cur)
                num = 0
                num_flag = 0
                neg_flag = 0
            elif c=='-':
                neg_flag = 1
        return stack[0] if len(stack)!=0 else (num if neg_flag == 0 else -num)
            

注意分情况讨论的完整性,注意if和elif的逻辑不同

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值