224. Basic Calculator
package LeetCode_224 import java.util.* /** * 224. Basic Calculator * https://leetcode.com/problems/basic-calculator/description/ * * Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces . Example 1: Input: "1 + 1" Output: 2 Example 2: Input: " 2-1 + 2 " Output: 3 Example 3: Input: "(1+(4+5+2)-3)+(6+8)" Output: 23 Note: You may assume that the given expression is always valid. Do not use the eval built-in library function. * */ class Solution { private val operator = listOf("+", "-") fun calculate(s: String): Int { val stack = Stack<String>() var i = s.length - 1 while (i >= 0) { if (s[i]==' '){ i-- continue } if (s[i] == ')' || s[i] == '+' || s[i] == '-') { stack.push(s[i].toString()) } else if (s[i] == '(') { val sum = getSum(stack) stack.pop() stack.push(sum.toString()) } else { val intSB = StringBuilder() //pick out the digit, for example:10 while (i >= 0 && s[i].isDigit()) { intSB.insert(0,s[i--]) } i++//prevent lose some operator, so need go back, for example: 2-1 + 2 stack.push(intSB.toString()) } i-- } //result = getSum(stack) return getSum(stack) } private fun getSum(stack: Stack<String>): Int { var sign = "+" var total = 0 while (stack.isNotEmpty() && stack.peek() != "(" && stack.peek() != ")") { if (stack.peek() in operator) { sign = stack.pop() } else { val temp = stack.pop().toInt() total += if (sign == "+") temp else -temp } } return total } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)
2019-06-13 993. Cousins in Binary Tree