377. Combination Sum IV
来源:互联网 发布:农村淘宝前景 编辑:程序博客网 时间:2024/05/28 17:07
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
Example:
nums = [1, 2, 3]target = 4The possible combination ways are:(1, 1, 1, 1)(1, 1, 2)(1, 2, 1)(1, 3)(2, 1, 1)(2, 2)(3, 1)Note that different sequences are counted as different combinations.Therefore the output is 7.
Follow up:
What if negative numbers are allowed in the given array?
How does it change the problem?
What limitation we need to add to the question to allow negative numbers?
class Solution { public int combinationSum4(int[] nums, int target) { if (nums.length == 0) return 0; Arrays.sort(nums); int[] dp = new int[target+1]; dp[0] = 1; for (int i = 1; i <= target; i++) { for (int j = 0; j < nums.length; j++) { if (i - nums[j] >= 0) dp[i] += dp[i - nums[j]]; else break; } } return dp[target]; }}
阅读全文
0 0
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV**
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- 377. Combination Sum IV
- java多线程(6)线程池
- SpringBoot的入门搭建(四)
- Sqlite3源码学习(5)OS的接口VFS
- 阿里数据源druid
- 反编译apk文件
- 377. Combination Sum IV
- 正确把控seo优化工作流程
- Serializable
- Ubuntu16.04 通过网线直连树莓派
- AUTOSAR 基础软件的内在安全
- 做一个个人主页
- Codeforces Round #449 (Div. 2) Codeforces Round #449 (Div. 2) 二叉树、回溯、分类讨论
- HashMap之扩容(三)
- 关于虚拟机开启FTP服务器,本地Windows不能访问的解决办法