basic_calculator/

hitzzc · hitzzc · commit 47f50e9c9897 · 2016-10-17T17:55:00.000+08:00
diff --git a/README.md b/README.md
@@ -180,6 +180,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [221. Maximal Square](https://github.com/hitzzc/go-leetcode/tree/master/maximal_square)
 #### [222. Count Complete Tree Nodes](https://github.com/hitzzc/go-leetcode/tree/master/count_complete_tree_nodes)
 #### [223. Rectangle Area](https://github.com/hitzzc/go-leetcode/tree/master/rectangle_area)
+#### [224. Basic Calculator](https://github.com/hitzzc/go-leetcode/tree/master/basic_calculator)
 
 
 
diff --git a/basic_calculator/basic_calculator.go b/basic_calculator/basic_calculator.go
@@ -0,0 +1,32 @@
+package basic_calculator
+
+func calculate(s string) int {
+	ret := 0
+	stack := []int{}
+	sign := 1
+	for i := 0; i < len(s); i++ {
+		if s[i] >= '0' && s[i] <= '9' {
+			num := 0
+			for ; i < len(s) && s[i] >= '0' && s[i] <= '9'; i++ {
+				num = 10*num + int(s[i]-'0')
+			}
+			ret += sign * num
+			i--
+		} else if s[i] == '+' {
+			sign = 1
+		} else if s[i] == '-' {
+			sign = -1
+		} else if s[i] == '(' {
+			stack = append(stack, ret, sign)
+			ret = 0
+			sign = 1
+		} else if s[i] == ')' {
+			signTmp := stack[len(stack)-1]
+			retTmp := stack[len(stack)-2]
+			stack = stack[:len(stack)-2]
+			ret = signTmp*ret + retTmp
+			sign = 1
+		}
+	}
+	return ret
+}
