A interesting DP problem

Правка en1, от wish_me, 2017-08-30 21:04:40

You are given a string and 2 operators ( & , | ). Return the total number of ways in which you can evaluate to true using the given string and operator set.

Example : Input : TF Output : 1 Input : TFF Output : 2 ( T | F & F , T | F | F )

Теги 3-d dp, memoization

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский wish_me 2017-08-30 21:04:40 267 Initial revision (published)