Java | LeetCode | 416. Partition Equal Subset Sum | 背包问题 | 动态规划

416. Partition Equal Subset Sum | 背包问题 | 动态规划

问题描述

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:

Each of the array element will not exceed 100.
The array size will not exceed 200.

Example 1:

Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: [1, 2, 3, 5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.

思路

本题要找是否给定的正数数组是否能被分成两部分，使两部分的和相等。也就是说，需要从物品（数组）中，找到价值（和）为数组总和的一半的物品，放进背包。

如果能够找到，返回true，否则false。

代码

class Solution {
   
    public boolean canPartition(int[] nums) {
   
    	// 数组求和