Skip to main content

Dynamic Programming - Hard Level - Question 3

Dynamic Programming - Hard Level - Question 3


Leetcode 1955 Count Number of Special Subsequences

A sequence is special if it consists of a positive number of 0s, followed by a positive number of 1s, then a positive number of 2s.

For example, [0,1,2] and [0,0,1,1,1,2] are special.

In contrast, [2,1,0], [1], and [0,1,2,0] are not special.

Given an array nums (consisting of only integers 0, 1, and 2), return the number of different subsequences that are special. Since the answer may be very large, return it modulo 10^9 + 7.

A subsequence of an array is a sequence that can be derived from the array by deleting some or no elements without changing the order of the remaining elements. Two subsequences are different if the set of indices chosen are different.

Constraints:

1 <= nums.length <= 10^5

0 <= nums[i] <= 2


Analysis:

For each element, there are three different choices: 0, 1, or 2.

Let focus on the 0 element first. If one element is 0, then there are two kinds of subsequences ending with 0:

A. the subsequences ending with previous 0's;

B. the subsequences ending with the current 0.

If we define a variable, sum0, to record the number of A, then number of B is sum0 + 1. Why?

Because 

1. each of the previous subsequence can be combined with the current 0 to form a new subsequence, which gives the number of sum0 in total;

2. the current 0 itself can form a new subsequence, which gives 1.

When the current 0 becomes one of the previous 0's, we need to update sum0 = sum0 + (sum0 + 1), to make it include both A and B.

Similarly, we can obtain the following formula for the numbers of subsequences ending with 1 and 2.

sum1 = sum1 + (sum1 + sum0)

sum2 = sum2 + (sum2 + sum1)


See the code below:


class Solution {
public:
    int countSpecialSubsequences(vector<int>& nums) {
        long mod = 1e9+7, sum0 = 0, sum1 = 0, sum2 = 0;
        int n = nums.size();
        for(int i=1; i<=n; ++i) {
            if(nums[i-1] == 0) {
                // sum0: the number of subsequences ending with all previous 0s
                // sum0 + 1:  the number of subsequence ending with the current 0
                sum0 += sum0 + 1;
                sum0 %= mod;
            }
            else if(nums[i-1] == 1) {
                // sum1: the number of subsequences ending with all previous 1s
                // sum1 + sum0:  the number of subsequence ending with the current 1
                sum1 += sum1 + sum0;
                sum1 %= mod;
            }
            else {
                // sum2: the number of subsequences ending with all previous 2s
                // sum2 + sum1:  the number of subsequence ending with the current 2
                sum2 += sum2 + sum1;
                sum2 %= mod;
            }
        }
        return sum2;
    }
};


Upper Layer

Comments

Post a Comment

Popular posts from this blog

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...
Post a Comment
Read more

Bit Manipulation - Example

  Leetcode 136 Single Number Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Constraints: 1 <= nums.length <= 3 * 10^4 -3 * 10^4 <= nums[i] <= 3 * 10^4 Each element in the array appears twice except for one element which appears only once. Analysis: If there is no space limitation, this question can be solved by counting easily. But counting requires additional space. Here we can use xor (^) operation based on some interesting observations:  A^A = 0, here A is any number A^0 = A, here A is any number Since all the number appears twice except one, then all the number appear even numbers will be cancelled out, and only the number appears one time is left, which is what we want. See the code below: class Solution { public: int singleNumber(vector<int>& nums) { int res = 0; for(auto ...
Post a Comment
Read more

Algorithm Advance Outline

Who wants to read these notes? 1. the one who wants to learn algorithm; 2. the one who has a planned interview in a short amount of time, such as one month later; 3. purely out of curiosity; 4. all the rest. The primary purpose for these posts is to help anyone who wants to learn algorithm in a short amount of time and be ready for coding interviews with tech companies, such as, Amazon, Facebook, Microsoft, etc. Before you start, you are expected to already know:  1. the fundamentals of at least one programming language; 2. the fundamentals of data structures. If you do not have these basics, it is better to "google and read" some intro docs, which should NOT take large amount of time. Of course, you can always learn whenever see a "unknown" data structure or line in the codes. Remember, "google and read" is always one of keys to learning. Common algorithms: 1. Recursion 2. Binary search 3. Dynamic programming 4. Breadth-first search 5. Depth-first search...
Post a Comment
Read more