*python3__leecode/面试题 03.01. 三合一

一、刷题内容

原题链接

https://leetcode-cn.com/problems/three-in-one-lcci/

内容描述

三合一。描述如何只用一个数组来实现三个栈。

你应该实现push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum)方法。stackNum表示栈下标，value表示压入的值。

构造函数会传入一个stackSize参数，代表每个栈的大小。

示例1:

 输入：
["TripleInOne", "push", "push", "pop", "pop", "pop", "isEmpty"]
[[1], [0, 1], [0, 2], [0], [0], [0], [0]]
 输出：
[null, null, null, 1, -1, -1, true]
说明：当栈为空时`pop, peek`返回-1，当栈满时`push`不压入元素。

示例2:

输入：
["TripleInOne", "push", "push", "push", "pop", "pop", "pop", "peek"]
[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]]
 输出：
[null, null, null, null, 2, 1, -1, -1]

二、解题方法

1.方法一

class TripleInOne:
    def __init__(self, stackSize: int):
        self.d = [4, 5, 6, stackSize * 3 + 3] + [0] * stackSize * 3

    def push(self, stackNum: int, value: int) -> None:
        if self.d[stackNum] <= self.d[3]:
            self.d[self.d[stackNum]] = value
            self.d[stackNum] += 3

    def pop(self, stackNum: int) -> int:
        if self.d[stackNum] > 6:
            self.d[stackNum] -= 3
            return self.d[self.d[stackNum]]
        return -1

    def peek(self, stackNum: int) -> int:
        return self.d[stackNum] <= 6 and -1 or self.d[self.d[stackNum] - 3]

    def isEmpty(self, stackNum: int) -> bool:
        return self.d[stackNum] <= 6

2.方法二：取反

~x = -x-1

class TripleInOne:
    def __init__(self, stackSize: int):
        self.d = [0] * stackSize * 3 + [stackSize * 3, 2, 1, 0]

    def push(self, stackNum: int, value: int) -> None:
        if self.d[~stackNum] < self.d[~3]:
            self.d[self.d[~stackNum]] = value
            self.d[~stackNum] += 3

    def pop(self, stackNum: int) -> int:
        if self.d[~stackNum] >= 3:
            self.d[~stackNum] -= 3
            return self.d[self.d[~stackNum]]
        return -1

    def peek(self, stackNum: int) -> int:
        return self.d[~stackNum] < 3 and -1 or self.d[self.d[~stackNum] - 3]

    def isEmpty(self, stackNum: int) -> bool:
        return self.d[~stackNum] < 3