Partition to K Equal Sum Subsets Leetcode #698 题解[Python]

题目来源

---

https://leetcode.com/problems/partition-to-k-equal-sum-subsets/description/

题目描述

---

Given an array of integers nums and a positive integer k, find whether it’s possible to divide this array into k non-empty subsets whose sums are all equal.

Example 1:
Input: nums = [4, 3, 2, 3, 5, 2, 1], k = 4
Output: True
Explanation: It’s possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.
Note:

1 <= k <= len(nums) <= 16.
0 < nums[i] < 10000.

Leetcode一贯的题风: 情景简单题目坑. 这题的题意依旧简洁: 给出一个数组和一个数字k, 若能够把数组分成k个子数组使得各个子数组之和相等, 则返回True, 否则返回False.

解题思路

---

首先有一点是很显然的;: 如果数组元素之和不能被k整除, 那么必定无解.
剩下的问题其实也就是一个比较简单的递归深搜.
设数组之和为total, 那么每个子数组之和就必须要等于tot