代码随想录训练营第III期--010--python

# 代码随想录训练营第III期--010--python
#  理论基础
#  232.用栈实现队列
# 用python实现，简直不要太轻松
class MyQueue:

    def __init__(self):
        self.stack = []


    def push(self, x: int) -> None:
        self.stack.append(x)


    def pop(self) -> int:
        pp = self.stack.pop(0)
        return pp 

    def peek(self) -> int:
        return self.stack[0]

    def empty(self) -> bool:
        return len(self.stack) == 0
#  225. 用队列实现栈
# 同上
class MyStack:

    def __init__(self):
        self.stack = []

    def push(self, x: int) -> None:
        self.stack.append(x)

    def pop(self) -> int:
        pp = self.stack.pop()
        return pp 

    def top(self) -> int:
        return self.stack[-1]

    def empty(self) -> bool:
        return len(self.stack) == 0
# LeetCode 每日一题
# 754 到达终点数字
# 不会，有个数学上的trick，没想到，抄的答案
class Solution:
    def reachNumber(self, target: int) -> int:
        target = target if target > 0 else -1*target
        s, n = 0,0 
        while s < target or (s - target) % 2 == 1:
            n += 1
            s += n 
        return n