Write the function to count the number of ways of parenthesizing the expression

Problem

Given a boolean expression consisting of the symbols 0,1, &, |, and ^, and a
desired boolean result value result, implement a function to count the number
of ways of parenthesizing the expression such that it evaluates to result.

 Example)

Expression: 1^0|0|1

Desired result: false (0)

Output: 2 ways. 1^( (0|0)|1) and 1^(0|(0|1)).

This is the last questions from "Cracking Coding" for Recursion & Dynamic programming.
I guess this book call "Memoization" part of Dynamic programming, a dynamic programming, which is not actually correct. 


Basic recursion approach


 Upshot

 Coming up with the recursion pattern for this problem is to first find the very high level  view of the problem.

 Given expression, 1^0|0|1  and expected value, e, we can see the following basic cases:
# of ways to put parentheses = count( 1^(0|0|1), e) + count( (1^0)|(0|1), e ) + count( (1^0|0)|1), e )

 Recursively, count( 1^(0|0|1), e)  = count(1, e) $\times$ count(0|0|1, e) etc.
Each time we break up the expression into two parts and call count on each part recursively.

 Cases for each operand

 Now, let's consider the possible cases for operands
For OR operator, "|", we consider both e = true and e = false.

 Case 1)  e = true, we consider three possible cases:

TRUE | TRUE, TRUE | FALSE, FALSE | TRUE
count( expr1 | expr2, true) = count(expr1, true) $\times$ count(expr2, true) + count(expr1, true) $\times$ count(expr2, false)  + count(expr1, false) $\times$ count(expr2, true) 

 Case 2)  e = false, we consider one possible case:

 FALSE | FALSE

 count( expr1 | expr2, false) = count(expr1, false) $\times$ count(expr2, false) 

For AND operator, "&", we also consider both e = true and e = false.

 Case 1)  e = true, we consider one possible case:

TRUE & TRUE

 count( expr1 & expr2, true) = count(expr1, true) $\times$ count(expr2, true) + count(expr1, true) $\times$ count(expr2, false)  + count(expr1, false) $\times$ count(expr2, true) 

 Case 2)  e = false, we consider three possible cases:

FALSE & FALSE, TRUE & FALSE, FALSE & TRUE
count( expr1 & expr2, false) = count(expr1, true) $\times$ count(expr2, false) + count(expr1, false) $\times$ count(expr2, true)  + count(expr1, false) $\times$ count(expr2, false) 

 Lastly, for XOR operator, "^", we also consider both e = true and e = false.

 Case 1)  e = true, we consider two possible cases:

TRUE ^ FALSE, FALSE ^ TRUE

 count( expr1 & expr2, true) = count(expr1, true) $\times$ count(expr2, false) + count(expr1, false) $\times$ count(expr2, true)  

 Case 2)  e = false, we consider two possible cases:

 TRUE ^ TRUE, FALSE ^ FALSE
count( expr1 & expr2, false) = count(expr1, true) $\times$ count(expr2, true) + count(expr1, false) $\times$ count(expr2, false)  

 Now, we are ready to write the first algorithm, which will run in $O(N \times N!)$
Here is the complete code using recursion. 


More efficient recursion with Memoization


Previous algorithm process the same problems repeated during the recursion. 
We can avoid this duplications by caching the intermediate results in the lookup table. 

The following code uses the Memoization. Only difference is the routine checking the std::map before perform the recursion and adding the resultant count to the std::map before returning the count at the end of the function.



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