leetcode 698. Partition to K Equal Sum Subsets
来源:互联网 发布:mac os 系统安装 编辑:程序博客网 时间:2024/05/17 03:10
题目链接:698. Partition to K Equal Sum Subsets
等级: medium
思路
直接使用dfs深搜,深搜过程中,记录以及匹配完全的子集合个数,以及深搜当前状态下的和等
实现
# include <iostream># include <vector>using namespace std;/*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 = 4Output: TrueExplanation: 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. */class Solution {public: vector<bool> visited; bool canPartitionKSubsets(vector<int>& nums, int k) { if(k == 1) return true; int sum = 0, size = nums.size(); for(int i = 0; i < size; i++) sum += nums[i]; if(sum % k) return false; this->visited = vector<bool>(size, false); return this->dfs(nums, 0, k, 0, sum / k); } bool dfs(vector<int> & nums, int index, int k, int c_sum, int target) { if(k == 1) return true; if(c_sum == target) return this->dfs(nums, 0, k - 1, 0, target); int size = nums.size(); for(int i = index; i < size; i++) if(this->visited[i] == false){ this->visited[i] = true; if(this->dfs(nums, i + 1, k, c_sum + nums[i], target)) return true; this->visited[i] = false; } return false; }};int main() { int a [] = {2, 2, 10, 5, 2, 7, 2, 2, 13}; vector<int> nums(a, a + 9); Solution so; cout << so.canPartitionKSubsets(nums, 3) << endl;}
阅读全文
0 0
- Leetcode | Partition to K Equal Sum Subsets
- [LeetCode] Partition to K Equal Sum Subsets
- leetcode 698. Partition to K Equal Sum Subsets
- Leetcode: 698. Partition to K Equal Sum Subsets
- leetcode-698. Partition to K Equal Sum Subsets
- leetcode 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets
- leetcode-698-Partition to K Equal Sum Subsets
- LeetCode #698 Partition to K Equal Sum Subsets
- Partition to K Equal Sum Subsets
- LWC 54:698. Partition to K Equal Sum Subsets
- 698. Partition to K Equal Sum Subsets(M)
- 设计模式C++实现(10)——桥接模式
- SpringMVC工作原理(源码分析)
- 1173: 【C语言训练】谁家孩子跑最慢*
- 后端技术要点
- 观察者模式
- leetcode 698. Partition to K Equal Sum Subsets
- 删数问题
- iOS OC动态运行时(runtime)~动态特性表现
- 直接可以用的Python和OpenCV检测及分割图像的目标区域例子
- 《JAVA编程思想》-第2章:一切都是对象
- WebViewJavascriptBridge 源码
- C++ 运算符
- 算法系列——二分查找算法及其变体总结
- 面向对象程序设计上机练习十(运算符重载)