zoukankan      html  css  js  c++  java
  • 216. Combination Sum III 组合总数三

    Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.


    Example 1:

    Input: k = 3, n = 7

    Output:

    [[1,2,4]]
    


    Example 2:

    Input: k = 3, n = 9

    Output:

    [[1,2,6], [1,3,5], [2,3,4]]
    

    Credits:
    Special thanks to @mithmatt for adding this problem and creating all test cases.


    1. class Solution:
    2. def combinationSum3(self, k, n):
    3. """
    4. :type k: int
    5. :type n: int
    6. :rtype: List[List[int]]
    7. """
    8. res = []
    9. def gen(l, k, n, cur):
    10. if k == len(l) and n == 0:
    11. res.append(l[:])
    12. return
    13. for i in range(cur, 10):
    14. l.append(i)
    15. gen(l, k, n - i, i + 1)
    16. l.pop()
    17. gen([], k, n, 1)
    18. return res





  • 相关阅读:
    电源
    SM2947
    网表
    cadence设计思路
    青山依旧在,几度夕阳红
    乐观锁与悲观锁
    笔记
    强弱软虚引用
    缓存相关
    dubbo
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/8379834.html
Copyright © 2011-2022 走看看