摘要：
Lesson learnt: for any calculator problems, keep 2 stacks: 1 for operators and 1 for operands.class Solution { stack op; stack data; void... 阅读全文
posted @ 2015-10-19 14:28
Tonix
阅读(182)
评论(0)
推荐(0)
摘要：
Sliding window doesn't work. So it is a typical partial_sum base solution. As below. However if you use a balanced binary search tree, you can get O(n... 阅读全文
posted @ 2015-10-19 04:37
Tonix
阅读(131)
评论(0)
推荐(0)
浙公网安备 33010602011771号