Evaluating the reverse polish notation

Problem

Given the list of strings consisting of the asthmatic equation expressed in the Reverse Polish notation.
Write the program that evaluates the equation and returns the result.

 Example:
   For {"4","1","+","2.5","*"}, output =12.5
   {"5", "80","40","/","+"} = 7


Answer

This question is similar to a previous question, "Evaluating arithmetic equation" but is simpler because the priority among operator had been handled already.

First of all we first need to understand Reverse Polish notation. (Read this link before proceed).

Based on Reverse polish notation, {"4","1","+","2.5","*"} equals to $(4+1) \times 2.5$ while {"5", "80","40","/","+"} is equivalent to $5+(80/40)$.

We can use the stack to solve this problem. Here is the rough algorithm:

1. Iterate over the list of strings.

2. If the current string is a number, push back the number into the stack

3. If the number is operator, take 2 numbers from the stack and compute the result before pushing back the result into the stack.

4. Return the number left on the top of the stack.

The running time of this algorithm is $O(N)$

Here is the complete code.



Practice statistics

19:05: hand-wrote the solution
02:27; validate the solution
21:33: write the code in IDE (3 typos found through compilation)
3:00: fixed the logical flaw after understanding what "Reverse Polish Notation" was



UPDATE (07-17-2019): solved the problem again in python.

Here is the solution in python

Statistics:

30:00: I think I spent around 20-30 mins with minor typos. Should not happen next time.


UPDATE(2022-06-14): Solved the question again in python

15:17: to write up the code

Comments

Post a Comment

Popular posts from this blog

Planting flowers with no adjacent flower plots

Image
Problem Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing booleans), return if a given number of new flowers can be planted in it without violating the no-adjacent-flowers rule  Sample inputs  Input: 1,0,0,0,0,0,1,0,0  3 => true  4 => false  Input: 1,0,0,1,0,0,1,0,0  1 => true  2 => false  input: 0  1 => true  2 => false  public boolean canPlaceFlowers(List flowerbed, int numberToPlace) {  // Implementation here  }
Read more
  Given an array of  intervals  where  intervals[i] = [start i , end i ] , merge all overlapping intervals, and return  an array of the non-overlapping intervals that cover all the intervals in the input . Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.   Constraints: 1 <= intervals.length <= 10 4 intervals[i].length == 2 0 <= start i <= end i <= 10 4
Read more

Find the maximum number of bomb that can be detonated

  Problem You are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb. The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes the radius of its range. You may choose to detonate a single bomb. When a bomb is detonated, it will detonate all bombs that lie in its range.  These bombs will further detonate the bombs that lie in their ranges. Given the list of bombs, return the maximum number of bombs that can be detonated if you are allowed to detonate only one bomb. Input: bombs = [[2,1,3],[6,1,4]] Output: 2 Explanation: The above figure shows the positions and ranges of the 2 bombs. If we detonate the left bomb, the right bomb will not be affected. But if we detonate the right bomb, both bombs will be detonated. So...
Read more