[leetcode]416.C++實現 分割等和子集(Partition Equal Subset Sum)

1.題目描述code 2題目分析blog dp[i][j] = dp[i - 1][j] || dp[i - 1][j - nums[i]];it 3.代碼實現io class Solution { public: bool canPartition(vector<int>& nums) { bool res = false; int sum = 0; int m = nums.si

>>阅读原文<<