698. Partition to K Equal Sum Subsets

最新推荐文章于 2025-03-12 19:03:19 发布

OovEver

最新推荐文章于 2025-03-12 19:03:19 发布

阅读量553

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： dp leetcode-java

本文链接：https://blog.youkuaiyun.com/mupengfei6688/article/details/78819754

LeetCode 专栏收录该内容

137 篇文章

订阅专栏

本文详细解析了LeetCode 698题——Partition to K Equal Sum Subsets，探讨如何判断能否将整数数组分割为k个子集，每个子集的和相等。通过递归回溯算法实现解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

698. Partition to K Equal Sum Subsets

题目描述：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.
题目大意：是否能将一个数组分为k个子数组

代码

package DP;

/**
* @Author OovEver
* @Date 2017/12/16 14:16
*/
public class LeetCode698 {
  public boolean canPartitionKSubsets(int[] nums, int k) {
      int sum = 0;
      for (int num : nums) {
          sum += num;
      }
      if (k<=0||sum % k != 0) {
          return false;
      }
      int target = sum / k;
      int[] visited = new int[nums.length];
      return canPartition(nums, visited, 0, k, 0, target);
  }

  public boolean canPartition(int[] nums, int[] visited, int start_index, int k, int cur_sum, int target) {
      if (k == 1) {
          return true;
      }
      if(cur_sum==target) return canPartition(nums, visited, 0, k - 1, 0, target);
      for(int i=start_index;i<nums.length;i++) {
          if (visited[i] == 0) {
              visited[i] = 1;
              if (canPartition(nums, visited, i + 1, k, cur_sum + nums[i],  target)) {
                  return true;
              }
              visited[i] = 0;
          }

      }
      return false;
  }
}