Skip to main content

Recursion - Hard Level - Question 1

Recursion - Hard Level - Question 1


Leetcode 761 Special Binary String

Special binary strings are binary strings with the following two properties:

The number of 0's is equal to the number of 1's.

Every prefix of the binary string has at least as many 1's as 0's.

You are given a special binary string s.

A move consists of choosing two consecutive, non-empty, special substrings of s, and swapping them. Two strings are consecutive if the last character of the first string is exactly one index before the first character of the second string.

Return the lexicographically largest resulting string possible after applying the mentioned operations on the string.

Constraints:

1 <= s.length <= 50

s[i] is either '0' or '1'.

s is a special binary string.


Analysis:

One way to solve this problem is to find all the 'special binary strings', and then just sort them reversely, and then concatenate them together.

The problem becomes how to break the input string down to sub-'special binary strings'. Based on the question, we can use a counter to count the number of '1' and '0'. Once them are the same, then it should be a 'special binary string'.

But there are cases that the 'special binary string' may NOT the optimal one (or NOT the one with the largest lexicographical value). For example, "11011000". This string itself is 'special binary string', but it is NOT the largest lexicographical one (which should be "11100100" for this example). 

Now the problem becomes how to make every 'special binary string' to be lexicographically largest, which essentially the same question as the original question! 

This is good, but we have to achieve the second condition before we can develop an algorithm of recursion: smaller size or shrinking the size of the question.

One of the key observation is that: the special binary string always start with '1' and end with '0'. Now the second condition can be realized: we just need to recursively adjust the the inner substring with the size smaller by 2.


See the code below:

class Solution {
public:
    string makeLargestSpecial(string s) {
        string res = "";
        int n = s.size();
        // base case
        if(!n) return res;
        vector<string> ss;
        int ct = 0, start = 0;
        for(int i=0; i<n; ++i) {
            if(s[i] == '1') ++ct;
            else --ct;
            if(!ct) {
                // recursive call
                string t = makeLargestSpecial(s.substr(start+1, i-start-1));
                ss.push_back("1" + t + "0");
                start = i + 1;
            }
        }
        sort(ss.begin(), ss.end(), greater<string>());
        for(auto &t : ss) res += t;
        return res;
    }
};

Comments

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...

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...

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...