LeetCode 1441. 用栈操作构建数组

原题目：https://leetcode-cn.com/problems/build-an-array-with-stack-operations/

 

代码;

class Solution(object):
    def buildArray(self, target, n):
        """
        :type target: List[int]
        :type n: int
        :rtype: List[str]
        """
        ans = []
        ans.extend(['Push','Pop']*(target[0]-1))
        ans.append('Push')
        for i in range(1,len(target)):
            ans.extend(['Push','Pop']*(target[i]-target[i-1]-1))
            ans.append('Push')

        return ans;