摘要:
You are given an array ' containing 0s and 1s. Find O(n) time and O(1) spacealgorithm to find the maximum sub sequence which has equal number of 1s and0s.Examples1) 10101010The longest sub sequence that satisfies the problem is the input itself2)1101000The longest sub sequence that satisfies the 阅读全文