leetcode-5.6[219. 存在重复元素 II、225. 用队列实现栈、226. 翻转二叉树]（python实现)

题目1

题解1

class Solution:
    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
        seen = list()
        n = len(nums)
        i = 0
        while i < n:
            if nums[i] in seen:
                index = seen.index(nums[i])
                if i - index <= k:
                    return True
                else:
                    seen[index] = "inf"
                    seen.append(nums[i])

            else:
                seen.append(nums[i])
            i += 1
        return False

附上题目链接

题目2

题解2

class MyStack:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.stack = list()


    def push(self, x: int) -> None:
        """
        Push element x onto stack.
        """
        self.stack.append(x)


    def pop(self) -> int:
        """
        Removes the element on top of the stack and returns that element.
        """
        return self.stack.pop()


    def top(self) -> int:
        """
        Get the top element.
        """
        return self.stack[-1]

    def empty(self) -> bool:
        """
        Returns whether the stack is empty.
        """
        return len(self.stack) <= 0


# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()

附上题目链接

题目3

题解3

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def invertTree(self, root: TreeNode) -> TreeNode:
        if root is None:
            return None
        else:
            self.overturn(root)
            return root
        
    def overturn(self, root):
        if root is None:
            return None
        else:
            root.left, root.right = root.right, root.left
            self.overturn(root.left)
            self.overturn(root.right)

附上题目链接