【leetcode Weekly Contest 107】927. Three Equal Parts

Given an array A of 0s and 1s, divide the array into 3 non-empty parts such that all of these parts represent the same binary value.ide If it is possible, return any [i, j] with i+1 < j, such that:cod

>>阅读原文<<