Clear some minor issues for finding the longest subarray containing equal number of 0 and 1 in it with O(n) time and space.