package leetcode

import java.util.*

/**
 * 150. 逆波兰表达式求值
 * https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/
 * Created by test
 * Date 2019/9/29 12:55
 * Description
 * 根据逆波兰表示法，求表达式的值。

有效的运算符包括 +, -, *, / 。每个运算对象可以是整数，也可以是另一个逆波兰表达式。

说明：

整数除法只保留整数部分。
给定逆波兰表达式总是有效的。换句话说，表达式总会得出有效数值且不存在除数为 0 的情况。
示例 1：

输入: ["2", "1", "+", "3", "*"]
输出: 9
解释: ((2 + 1) * 3) = 9
示例 2：

输入: ["4", "13", "5", "/", "+"]
输出: 6
解释: (4 + (13 / 5)) = 6
示例 3：

输入: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
输出: 22
解释:
((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/evaluate-reverse-polish-notation
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 */

object EvaluateReversePolishNotation {

    @JvmStatic
    fun main(args: Array<String>) {
        println(Solution().evalRPN(arrayOf("2", "1", "+", "3", "*")))
    }

    class Solution {
        fun evalRPN(tokens: Array<String>): Int {
            val stack = Stack<Int>()
            tokens.forEach {
                val op = it
                when (op) {
                    "+" -> {
                        val left = stack.pop()
                        val right = stack.pop()
                        stack.push(left + right)
                    }
                    "-" -> {
                        val right = stack.pop()
                        val left = stack.pop()
                        stack.push(left - right)
                    }
                    "*" -> {
                        val left = stack.pop()
                        val right = stack.pop()
                        stack.push(left * right)
                    }
                    "/" -> {
                        val right = stack.pop()
                        val left = stack.pop()
                        if (right != 0) {
                            stack.push((left / right).toInt())
                        } else {
                            stack.push(left)
                        }
                    }
                    else -> {
                        stack.push(op.toInt())
                    }
                }
            }
            return stack.pop().toInt()
        }
    }
}
package leetcode

import java.util.*

/**
 * 150. 逆波兰表达式求值
 * https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/
 * Created by test
 * Date 2019/9/29 12:55
 * Description
 * 根据逆波兰表示法，求表达式的值。

有效的运算符包括 +, -, *, / 。每个运算对象可以是整数，也可以是另一个逆波兰表达式。

说明：

整数除法只保留整数部分。
给定逆波兰表达式总是有效的。换句话说，表达式总会得出有效数值且不存在除数为 0 的情况。
示例 1：

输入: ["2", "1", "+", "3", "*"]
输出: 9
解释: ((2 + 1) * 3) = 9
示例 2：

输入: ["4", "13", "5", "/", "+"]
输出: 6
解释: (4 + (13 / 5)) = 6
示例 3：

输入: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
输出: 22
解释:
((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/evaluate-reverse-polish-notation
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 */

object EvaluateReversePolishNotation {

    @JvmStatic
    fun main(args: Array<String>) {
        println(Solution().evalRPN(arrayOf("2", "1", "+", "3", "*")))
    }

    class Solution {
        fun evalRPN(tokens: Array<String>): Int {
            val stack = Stack<Int>()
            tokens.forEach {
                val op = it
                when (op) {
                    "+" -> {
                        val left = stack.pop()
                        val right = stack.pop()
                        stack.push(left + right)
                    }
                    "-" -> {
                        val right = stack.pop()
                        val left = stack.pop()
                        stack.push(left - right)
                    }
                    "*" -> {
                        val left = stack.pop()
                        val right = stack.pop()
                        stack.push(left * right)
                    }
                    "/" -> {
                        val right = stack.pop()
                        val left = stack.pop()
                        if (right != 0) {
                            stack.push((left / right).toInt())
                        } else {
                            stack.push(left)
                        }
                    }
                    else -> {
                        stack.push(op.toInt())
                    }
                }
            }
            return stack.pop().toInt()
        }
    }
}