题解 | #栈的压入、弹出序列#
栈的压入、弹出序列
https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106
object Solution { fun IsPopOrder(pushV: IntArray, popV: IntArray): Boolean { val tempStack = mutableListOf<Int>() var popVIndex = 0 pushV.forEach { tempStack.add(it) while (tempStack.isNotEmpty() && tempStack.last() == popV[popVIndex]) { tempStack.removeLast() popVIndex++ } } return tempStack.isEmpty() } }