data_structures/stack_str.py at master · newadays/data_structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
class stack:
    def __init__(self):
        self.stack = []

    def pop(self):
        if self.is_empty():
            return
        else:
            return self.stack.pop()

    def push(self, data):
        self.stack.append(data)

    def top(self):
        if self.is_empty():
            return None
        else:
            return self.stack[-1]

    def size(self):
        return len(self.stack)

    def is_empty(self):
        return self.size() == 0


class Solution:
    # reverse LL using stacks
    # @param A : string
    # @return a strings
    def reverseString(self, A):
        s = []
        for i in A:
            s.append(i)
            ar = ''

        i = len(s)
        ar = ''
        while i > 0:
            ar += s.pop()
            i -= 1
        return ar

    def reverseString2(self, A):
        i = 0
        A = list(A)
        j = len(A) - 1
        while i < j:
            A[i], A[j] = A[j], A[i]
            i += 1
            j -= 1

        return str(A)

    #Balance Parentheses
    # @param A : string
    # @return an integer
    def isValid(self, A):
        def is_empty(arr):
            if len(arr) > 0:
                return False
            else:
                return True
        s = []
        ar = {"(":")", "[":"]", "{":"}"}
        for i in A:
            if i in ar:
                s.append(i)
            else:
                if is_empty(s):
                    return 0
                else:
                    if ar[s[-1]]!=i:
                        return 0
                    else:
                        s.pop()
        if is_empty(s):
            return 0
        else:
            return 1

    # @param A : list of integers
    # @return an integer
    def largestRectangleArea(self, A):
        height = A
        height.append(0)
        stack = [-1]
        ans = 0
        for i in range(len(height)):
            while height[i] < height[stack[-1]]:
                h = height[stack.pop()]
                w = i - stack[-1] - 1
                ans = max(ans, h * w)
            stack.append(i)
        return ans

    def longestValidParentheses(self, A):
        """
        :type s: str
        :rtype: int
        """
        # ls = {"(":")"}
        s = []
        s.append(-1)
        res = 0

        def is_empty(arr):
            if len(arr) > 0:
                return False
            else:
                return True

        for i in range(len(A)):
            if (A[i] == '('):
                s.append(i)
            else:
                s.pop()
                if is_empty(s):
                    s.append(i)
                else:
                    r = i - s[-1]
                    res = max(r, res)

        return res


# A = "[{"
Sols = Solution()
# print(Sols.reverseString2(A))
# print(Sols.isValid(A))
print(Sols.largestRectangleArea([2, 1, 5, 6, 2, 3]))