5
todo_416.Pacific_Atlantic_Water_Flow copy
source link: http://muyunyun.cn/blog/LeetCode/todo_416.Pacific_Atlantic_Water_Flow%20copy/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
416. Partition Equal Subset Sum
Given a non-empty array nums 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.
Example 1:
Input: nums = [1,5,11,5]
Output: true
Explanation: The array can be partitioned as [1, 5, 5] and [11].
Example 2:
Input: nums = [1,2,3,5]
Output: false
Explanation: The array cannot be partitioned into equal sum subsets.
Constraints:
- 1 <= nums.length <= 200
- 1 <= nums[i] <= 100
Analyze
* @param {number[]} nums
* @return {boolean}
var canPartition = function(nums) {
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK