Equal Tree Partition
来源:互联网 发布:自考本科 留学 知乎 编辑:程序博客网 时间:2024/06/05 12:48
public boolean canPartition(int[] nums) { int sum = 0; for (int num : nums) { sum += num; } if ((sum & 1) == 1) { return false; } sum /= 2; int n = nums.length; boolean[][] dp = new boolean[n+1][sum+1]; for (int i = 0; i < dp.length; i++) { Arrays.fill(dp[i], false); } dp[0][0] = true; for (int i = 1; i < n+1; i++) { dp[i][0] = true; } for (int j = 1; j < sum+1; j++) { dp[0][j] = false; } for (int i = 1; i < n+1; i++) { for (int j = 1; j < sum+1; j++) { dp[i][j] = dp[i-1][j]; if (j >= nums[i-1]) { dp[i][j] = (dp[i][j] || dp[i-1][j-nums[i-1]]); } } } return dp[n][sum];}
阅读全文
0 0
- Equal Tree Partition
- leetcode 663. Equal Tree Partition
- Partition Equal Subset Sum
- Partition Equal Subset Sum
- Partition Equal Subset Sum
- Partition Equal Subset Sum
- Partition Equal Subset Sum
- Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- [LeetCode416]Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- LeetCode: Partition Equal Subset Sum
- [Medium]Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- PageRank算法详解
- Saving Tang Monk HDU
- Linux搭建 SVN 服务器
- DoTa、LOL类游戏转移视角及角色移动
- Android Handler,Message
- Equal Tree Partition
- Vue介绍
- 创建petalinux工程的两种方法
- python的基本数据类型
- 2017.8.25------暑假集训总结
- 20170825阿里在线笔试之菜鸟仓库货架格子编号
- updatedb 更新locate搜索的数据库
- 2018阿里软件工程师笔试题
- 暑假集训总结