Garin.Tian

贴一个解法，增加两种剪枝，第二种剪枝不怎么用，只有在数组中具有大量和target相等的数时才有用。 ```py class Solution: def canPartitionKSubsets(self, nums: List[int], k: int) -> bool: total_sum = sum(nums) if total_sum % k != 0: return False self.target = total_sum // k nums =...

Hello, have you sovled this issue? I have problem to reproduce attention weighting and linear weighting, anyone could help me?