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

Post a Comment

Popular posts from this blog

Binary Search - Hard Level - Question 3

Binary Search - Hard Level - Question 3 878. Nth Magical Number A positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 10^9 + 7. Analysis: Let us consider some examples first. Example 1, a = 4, b = 2. If b is dividable by a, then all the numbers which is dividable by a should be dividable by b as well. So the nth magical number should be n*b; Example 2, a = 3, b = 2. The multiples of 2 are: 2, 4, 6, 8, 10, 12, ... The multiple of 3 are: 3, 6, 9, 12, ... So the overlap is related to the minimum common multiple between a and b, and we need to remove the overlap which is double-counted. So now, we make some conclusions: 1. the upper bound of the nth magical number should be n*b, where a is the smaller one (or b <= a); 2. there are n*b/a magical numbers smaller than n*b; 3. there are n*b/(minimum common multiple) overlaps. Thus, the overall count is: n + ...
Post a Comment
Read more

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once...
Post a Comment
Read more

Recursion - Example

Recursion - Example Leetcode 231  Power of Two Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2^x Constraints: -2^31 <= n <= 2^31 - 1 Analysis: One way is to think about this question recursively: if n%2 == 1, then n must not be power of 2; if not, then we just need to consider whether (n/2) is a power of 2 or not. This is exactly the "same question with a smaller size"! It is trivial to figure out the base cases: if n == 0, return false; if n == 1, return true. See the code below: class Solution { public: bool isPowerOfTwo(int n) { // base cases if(n == 0) return false; if(n == 1) return true; // converging if(n%2 == 1) return false; return isPowerOfTwo(n/2); } }; If interested, there are some other ways to solve this problem. For example, using bit manipulation, we can have the following solution: class ...
Post a Comment
Read more