1441_build_an_array_with_stack_operations.py

class Solution:
    def buildArray(self, target: List[int], n: int) -> List[str]:
        target_set = set(target)
        ans = []
        push = 'Push'
        pop = 'Pop'
        length = min(n+1, max(target)+1)
        for i in range(1, length):
            if i in target_set:
                ans.append(push)
            else:
                ans.append(push)
                ans.append(pop)
        return ans

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''