s*t
1 楼
Given an array of integers(both positive and negative) divide the array into
two parts(sub-arrays) such that the
difference between the sum of elements in each array is minimum????
two parts(sub-arrays) such that the
difference between the sum of elements in each array is minimum????