Skip to main content

Bit Manipulation - Medium Level

 Leetcode 416 Partition Equal Subset Sum

Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

Constraints:

1 <= nums.length <= 200

1 <= nums[i] <= 100


Analysis:


There are different ways to solve this problem, such as dp with a time complexity of O(N^2).

Since N is small to this question, so it is Okay to pass OJ.

Besides the small N, the value of each element is also very small. So this gives us some chance to use "space to trad off time".

The data structure to be used is bitset. For bitset, each bit can be either 0 or 1. The index of that bit can be used as the corresponding sum. When the bit is 1, means there is a sum with the value of its index.

When a new number comes, this number needs to be added to all the previous sums, to form new "previous" sums. Thus for each number, we need to go through all the previous sums, the time complexity of which is O(N^2) in average. There are N numbers, so the overall time complexity is O(N^3).

With a bitset, for each number, we just need to use the shift operator (<< and >>) and the or (|) operator directly, without go through all the previous sums. The time complexity is from O(N^2) to O(1). Here is how it works:

1. All the previous sums are stored in the bitset (the index of 1's);

2. When a new number is taken into account, we just need to shift the bitset to the left by the value of the number (let say X). Then all the 1's will be shifted left by X bits, so all the previous sums are updated by adding X with this one time operation!

3. We still need to keep the previous sums before the update in 2. And or (|) operation between the bitset before the update and that after the update would perfectly solve this problem.

After scanning to the last number, we just need to check

1. the overall sum is even or not; if odd, return false directly

2. if even, we just need to check the bit value of the bit at the index of (total sum)/2 in the bitset. If 1, return true; o/w, return false.


See the code below:


class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int sum = 0;
        bitset<20001> bt(1); // bt[0] is 1
        for(auto &a : nums) {
            sum += a;
            bt |= bt << a;
        }
        return !(sum & 1) && bt[sum >> 1];
    }
};


Upper Layer

Comments

Post a Comment

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 ...
Post a Comment
Read more

Sliding Window - Question 1

Leetcode 76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". The testcases will be generated such that the answer is unique. A substring is a contiguous sequence of characters within the string. Constraints: m == s.length n == t.length 1 <= m, n <= 10^5 s and t consist of uppercase and lowercase English letters. Analysis: The first step to do is to count the letters in string t, since the relative order of chars does not matter. After the counting, we can use two pointers method on string s: starting with beginning of the string s, the second pointer can continue to move until the sub-string [i, j) has all the chars in t, where i the index of the first pointer, and j is the index of the second pointer. We are looking for the sub-string with the minimum leng...
Post a Comment
Read more