声明:原题目转载自LeetCode,解答部分为原创
Problem :
Given a non-empty array 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.
Note:
声明:原题目转载自LeetCode,解答部分为原创
Problem :
Given a non-empty array 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.
Note: