[LeetCode]Partition Equal Subset Sum(Java)
2017-03-21 21:28
375 查看
又是一道穷举改动态规划的题,根据今天的面试结果我决心把动态规划练得炉火纯青!
public class Solution {
public boolean canPartition(int[] nums) {
// check edge case
if (nums == null || nums.length == 0) {
return true;
}
// preprocess
int volumn = 0;
for (int num : nums) {
volumn += num;
}
if (volumn % 2 != 0) {
return false;
}
volumn /= 2;
// dp def
boolean[] dp = new boolean[volumn + 1];
// dp init
dp[0] = true;
// dp transition
for (int i = 1; i <= nums.length; i++) {
for (int j = volumn; j >= nums[i-1]; j--) {
dp[j] = dp[j] || dp[j - nums[i-1]];
}
}
return dp[volumn];
}
}2017/03/21
纪念刚面完微信虐心中
public class Solution {
public boolean canPartition(int[] nums) {
// check edge case
if (nums == null || nums.length == 0) {
return true;
}
// preprocess
int volumn = 0;
for (int num : nums) {
volumn += num;
}
if (volumn % 2 != 0) {
return false;
}
volumn /= 2;
// dp def
boolean[] dp = new boolean[volumn + 1];
// dp init
dp[0] = true;
// dp transition
for (int i = 1; i <= nums.length; i++) {
for (int j = volumn; j >= nums[i-1]; j--) {
dp[j] = dp[j] || dp[j - nums[i-1]];
}
}
return dp[volumn];
}
}2017/03/21
纪念刚面完微信虐心中
相关文章推荐
- leetcode解题之416#Partition Equal Subset SumJava版. 对半分(0-1背包,动态规划)
- leetCode No.416 Partition Equal Subset Sum
- LeetCode—— Partition Equal Subset Sum
- leetcode-416-Partition Equal Subset Sum
- [Leetcode] #416 Partition Equal Subset Sum
- 【Leetcode】416-Partition Equal Subset Sum -- javascript解法 01背包问题
- [LeetCode] Partition Equal Subset Sum
- Partition Equal Subset Sum - leetcode 416号题目个人题解
- [LeetCode] Partition Equal Subset Sum 相同子集和分割
- LeetCode No.416 Partition Equal Subset Sum
- LeetCode #416: Partition Equal Subset Sum
- [LeetCode] Partition Equal Subset Sum
- leetcode(416). Partition Equal Subset Sum
- LeetCode Partition Equal Subset Sum
- LeetCode: Partition Equal Subset Sum
- Leetcode: Partition Equal Subset Sum
- leetcode 416 Partition Equal Subset Sum 对半分
- [LeetCode]Partition Equal Subset Sum
- leetcode--- Partition Equal Subset Sum---动规
- [LeetCode] Partition Equal Subset Sum划分数组形成两个和相等的子集